Pseudo-random sequences and arrays
- 1 January 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 64 (12), 1715-1729
- https://doi.org/10.1109/proc.1976.10411
Abstract
Binary sequences of length n = 2m- 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 = 2lm- 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.Keywords
This publication has 49 references indexed in Scilit:
- A class of nonlinear de Bruijn cyclesJournal of Combinatorial Theory, Series A, 1975
- The Subsequence Weight Distribution of Summed Maximum Length Digital SequencesIEEE Transactions on Communications, 1974
- Irreducible polynomials over composite Galois fields and their applications in coding techniquesProceedings of the Institution of Electrical Engineers, 1974
- The Index of an M -SequenceSIAM Journal on Applied Mathematics, 1973
- On a Scrambling Property of Feedback Shift RegistersIEEE Transactions on Communications, 1972
- Combinatorics: Room Squares, Sum-Free Sets, Hadamard MatricesLecture Notes in Mathematics, 1972
- Decomposition of M-sequences and its applicationsIEEE Transactions on Information Theory, 1971
- On primitive trinomials (Mod 2)Information and Control, 1968
- Autocorrelation function of a 4-levelmsequenceElectronics Letters, 1968
- Linear Recurring SequencesJournal of the Society for Industrial and Applied Mathematics, 1959