IEEE Transactions on Information Theory · 2008 · 47 citations · 25 references
New Binary SequencesEngineeringComplete Autocorrelation DistributionEntropyPseudo-random SequenceAutocorrelation MagnitudeComputational ComplexityProbability TheoryCoding TheorySequence DesignSignal ProcessingAlgebraic Coding Theory
New binary sequences of period N = 4(2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> - 1) for even m ges 4 are found, where the sequences are described by a 4 X (2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> - 1) array structure. The new sequences are almost balanced and have four- valued autocorrelation, i.e., {N, 0, plusmn4}, which is optimal with respect to autocorrelation magnitude. The complete autocorrelation distribution and the exact linear complexity of the sequences are mathematically derived. Finally, it is shown that the sequences are implemented by a combination of linear feedback shift registers and a simple logic.
25
Shift-register synthesis and BCH decoding
J. Massey · IEEE Transactions on Information Theory · 1969 · 2.2K citations
K.W. Cattermole · Electronics and Power · 1968 · 1.3K citations
Sequence Motif, Shift Register Sequences, Computer Science +2