Proceedings of the IEEE · 1976 · 737 citations · 51 references
ComputingComputer ScienceAlgorithmsData StructuresSequence AnalysisAutocorrelation AnalysisCoding TheoryAutocorrelation FunctionAutocorrelation Function AnalysisPseudorandomnessTwo-dimensional Arrays
Binary sequences of length n = 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> - 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 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">lm</sup> - 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.
51
The Art of Computer Programming
W.J. Worlton · Nuclear Science and Engineering · 1968 · 2.3K citations
R. G. Gallager, W. W. Peterson · Mathematics of Computation · 1962 · 2.1K citations
J. J. Stiffler · 1971 · 1.4K citations
K.W. Cattermole · Electronics and Power · 1968 · 1.3K citations