Title :
Constructing Periodic Binary Sequences With Maximum Nonlinear Span
Author :
Rizomiliotis, Panagiotis
Author_Institution :
ESAT, Katholieke Univ., Leuven, Heverlee
Abstract :
The nonlinear span of a sequence x is defined as the length of the shortest feedback shift register that generates x. In this correspondence, we solve the problem of designing periodic binary sequences with given linear complexity and maximal possible nonlinear span. We concentrate on the case of sequences with period N=2n-1 and we introduce two construction methods
Keywords :
binary sequences; binary periodic sequence; feedback shift register; linear complexity; maximum nonlinear span; Australia; Binary sequences; Cryptography; Feedback; Informatics; Information theory; Interpolation; Lagrangian functions; Security; Shift registers; Binary periodic sequence; linear complexity; maximal nonlinear span; nonlinear feedback shift register;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2006.880054
