Re: Toaster to Generate Random Numbers
From: Tony T. Warnock (u091889@cic-mail.lanl.gov)
Date: 02/12/03
- Next message: ekj@ekj.vestdata.no: "Re: algorithm for medium security, fast encryption ??"
- Previous message: Francois Grieu: "Re: Fletcher Checksum Question"
- In reply to: Rob Warnock: "Re: Toaster to Generate Random Numbers"
- Next in thread: Alun Jones: "Re: Toaster to Generate Random Numbers"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
From: "Tony T. Warnock" <u091889@cic-mail.lanl.gov> Date: Wed, 12 Feb 2003 07:54:58 -0700
There is no bias. The excess number of 1's is N/Log(N) and thus as N
gets large the bias is 1/Log(N) which goes to zero.
The "strong" law of large numbers isn't very strong.
Dropping the leading 1's is in Postnikov's big article from the 1960s.
It removes the bias but not local clusters. (I think that there is no
way to remove those clusters if construction proceeds by concatination)
- Next message: ekj@ekj.vestdata.no: "Re: algorithm for medium security, fast encryption ??"
- Previous message: Francois Grieu: "Re: Fletcher Checksum Question"
- In reply to: Rob Warnock: "Re: Toaster to Generate Random Numbers"
- Next in thread: Alun Jones: "Re: Toaster to Generate Random Numbers"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|