On the Quadratic Spans of DeBruijn Sequences

IEEE Transactions on Information Theory

Volumn 36, Issue 4, 1990, Pages 822-829

  Chan, Agnes H ^a   Games, Richard A ^a  

^a MITRE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--ALGORITHMS;

DEBRUIJN SEQUENCES; PSEUDORANDOM SEQUENCES; QUADRATIC SPANS;

MATHEMATICAL STATISTICS;

EID: 0025464667     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.53741     Document Type: Article

References (8)

1. A. H. Chan, R. A. Games, and E. L. Key, “On the complexity of DeBruijn sequences,” J. Combin. Theory, vol. 33, no. 3, pp. 233–246, 1982.
2. H. Fredricksen, “A survey of full length nonlinear shift register cycle algorithms,” SIAM Review, vol. 24, pp. 195–221, 1982.
3. E. J. Groth, “Generation of binary sequences with controllable complexity,” IEEE Trans. Inform. Theory, vol. IT-17, pp. 288–296, 1971.
4. K. Imamura and W. Yoshida, “A simple derivation of the Berlekamp-Massey algorithm and some applications,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 146–150, 1987.
5. E. L. Key, “An analysis of the structure and complexity of nonlinear binary sequence generators,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 732–736, 1976.
6. J. L. Massey, “Shift-register synthesis and BCH decoding,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 122–127, 1969.
7. R. A. Rueppel, “New approaches to stream ciphers,” Ph.D. thesis, Swiss Federal Inst, of Technol., Zurich, Switzerland, 1984.
8. R. A. Rueppel and O. Staffelbach, “Linear recurring sequences with maximum complexity,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 126–131, 1987.