Pseudo-random sequences and arrays

Binary sequences of length n = 2 m - 1 whose autocorrelation function is either 1 or -1/n have been known for a long time, and are called pseudo-random (or PN) sequences, or maximal-length shift-register sequences. Two-dimensional arrays of area n = 2 lm - 1 with the same property have rcently been...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the IEEE 1976-01, Vol.64 (12), p.1715-1729
Main Authors: MacWilliams, F.J., Sloane, N.J.A.
Format: Article
Language:English
Subjects:
Autocorrelation
Binary sequences
Code standards
Fault detection
Mathematics
Polynomials
Product codes
Shift registers
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Binary sequences of length n = 2 m - 1 whose autocorrelation function is either 1 or -1/n have been known for a long time, and are called pseudo-random (or PN) sequences, or maximal-length shift-register sequences. Two-dimensional arrays of area n = 2 lm - 1 with the same property have rcently been found by several authors. This paper gives a simple description of such sequences and arrays and their many nice properties.
ISSN:0018-9219
DOI:10.1109/PROC.1976.10411