Sequences which obey the three randomness postulates of Golomb are usually called pseudo-noise sequences (PN-sequences). The primary examples of such sequences are the maximumlength linear sequences, i.e., the m-sequences (see also Golomb's randomness postulates).
This is a preview of subscription content, log in via an institution to check access.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 International Federation for Information Processing
About this entry
Cite this entry
Helleseth, T. (2005). Pseudo-Noise Sequence (PN-Sequence). In: van Tilborg, H.C.A. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA . https://doi.org/10.1007/0-387-23483-7_326
Download citation
DOI: https://doi.org/10.1007/0-387-23483-7_326
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-23473-1
Online ISBN: 978-0-387-23483-0
eBook Packages: Computer ScienceReference Module Computer Science and Engineering