Golomb’s Randomness Postulates
 Tor Helleseth
 … show all 1 hide
Related Concepts
Autocorrelation; Gap; MaximalLength Linear Sequences; PseudoNoise Sequences (PNSequences); Run; Sequences
Definition
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 [1] introduced the notion of a pseudorandom 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
Within this Entry
 Related Concepts
 Definition
 Theory and Applications
 Recommended Reading
 Recommended Reading
 Golomb SW (1967) Shift register sequences. HoldenDay series in information systems. HoldenDay, San Francisco. Revised ed., Aegean Park Press, Laguna Hills, 1982
 Golomb SW, Gong G (2005) Signal design for good correlation – for wireless communication, cryptography, and radar. Cambridge University Press, Cambridge CrossRef
 Title
 Golomb’s Randomness Postulates
 Reference Work Title
 Encyclopedia of Cryptography and Security
 Pages
 pp 516517
 Copyright
 2011
 DOI
 10.1007/9781441959065_351
 Print ISBN
 9781441959058
 Online ISBN
 9781441959065
 Publisher
 Springer US
 Copyright Holder
 Springer Science+Business Media, LLC
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Henk C. A. van Tilborg ^{(376)}
 Sushil Jajodia ^{(377)}
 Editor Affiliations

 376. Department of Mathematics and Computing Science, Eindhoven University of Technology
 377. Center for Secure Information Systems, George Mason University
 Authors

 Tor Helleseth ^{(1)}
 Author Affiliations

 1. The Selmer Center, Department of Informatics, University of Bergen, PB 7803, N5020, Bergen, Norway
Continue reading...
To view the rest of this content please follow the download PDF link above.