Golomb’s Randomness Postulates
- Tor HellesethAffiliated withThe Selmer Center, Department of Informatics, University of Bergen
Golomb’s randomness postulates are three properties that one expects to find in random sequences.
Theory and Applications
No finite sequence constructed by a linear feedback shift register is a truly random sequence. Golomb  introduced the notion of a pseudo-random sequence for a periodic binary sequence that satisfies three randomness postulates. These postulates reflect the properties one would expect to find in a random sequence.
A run in a binary sequence is a set of consecutive 0s or 1s. A run of0s is denoted a gap and a run of 1s is denoted a block. A gap of length k is a set of k consecutive 0s flanked by 1s. A block of length k is a set of k consecutive 1s flanked by 0s. A run of length k is is a gap of length k or a block of length k. In this terminology, the three randomness postulates of a perio ...
Reference Work Entry Metrics
- Golomb’s Randomness Postulates
- Reference Work Title
- Encyclopedia of Cryptography and Security
- pp 516-517
- Print ISBN
- Online ISBN
- Springer US
- Copyright Holder
- Springer Science+Business Media, LLC
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 376. Department of Mathematics and Computing Science, Eindhoven University of Technology
- 377. Center for Secure Information Systems, George Mason University
- Tor Helleseth (1)
- Author Affiliations
- 1. The Selmer Center, Department of Informatics, University of Bergen, PB 7803, N-5020, Bergen, Norway
To view the rest of this content please follow the download PDF link above.