Permutation polynomials, de Bruijn sequences, and linear complexity

Journal of Combinatorial Theory. Series A

Volumn 76, Issue 1, 1996, Pages 55-82

  Blackburn, Simon R ^a   Etzion, Tuvi ^a,b   Paterson, Kenneth G ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030268981     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1996.0088     Document Type: Article

References (17)

1. 1. T. Van Aardenne Ehrenfest and N. G. de Bruijn, Circuits and trees in oriented linear graphs, in "Classic papers in Combinatorics" (I. Gessel and G.-C. Rota, Eds.), Birkhäuser, Boston, 1987; reprinted from Simon Stevin 28 (1951), 203-217.
2. 1. T. Van Aardenne Ehrenfest and N. G. de Bruijn, Circuits and trees in oriented linear graphs, in "Classic papers in Combinatorics" (I. Gessel and G.-C. Rota, Eds.), Birkhäuser, Boston, 1987; reprinted from Simon Stevin 28 (1951), 203-217.
3. 2. S. R. Blackburn, A generalization of the discrete Fourier transform: Determining the minimal polynomial of a periodic sequence, IEEE Trans. Inform. Theory 40 (1994), 1702-1704.
4. 3. J. A. Bondy and U. S. R. Murty, "Graph Theory with Applications," Elsevier, Amsterdam, 1976.
5. 4. A. H. Chan, R. A. Games, and E. L. Key, On the complexities of de Bruijn sequences, J. Combin. Theory Ser. A 33 (1982), 233-246.
6. 5. N. G. de Bruijn, A combinatorial problem, Proc. Kon. Nederl. Akad. Wetensch. 49 (1946), 758-764.
7. 6. S. Dolinar, T.-M. Ko, and R. McEliece, Some VLSI decompositions of the de Bruijn graph, Discrete Math. 106/107 (1992), 189-198.
8. 7. T. Etzion, On the distribution of de Bruijn sequences of low complexity, J. Combin. Theory Ser. A 38 (1985), 241-253.
9. 8. T. Etzion and A. Lempel, On the distribution of de Bruijn sequences of given complexity, IEEE Trans. Inform. Theory 30 (1984), 611-614.
10. 9. T. Etzion and A. Lempel, Construction of de Bruijn sequences of minimal complexity, IEEE Trans. Inform. Theory 30 (1984), 705-709.
11. 10. H. Fredricksen, A survey of full length shift register cycle algorithms, SIAM Rev. 24 (1982), 195-221.
12. n-1+n+1, J. Combin. Theory Ser. A 34 (1983), 248-251.
13. 12. S. W. Golomb, "Shift Register Sequences," Holden-Day, San Francisco, 1967.
14. 13. C. G. Günther, Alternating step generators controlled by de Bruijn sequences, in "Proceedings of EUROCRYPT '87" (D. Chaum and W. L. Price, Eds.), Lecture Notes in Computer Science, Vol. 304, Springer-Verlag, Berlin, 1988.
15. 14. R. Lidl and H. Niederreiter, "Finite Fields," Encyclopedia of Mathematics and Its Applications, Vol. 20, Addison-Wesley, London, 1983.
16. 15. J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Inform. Theory 15 (1969), 122-127.
17. 16. K. G. Paterson, Perfect factors in the de Bruijn graph, Designs, Codes and Cryptogr. 5 (1995), 115-138.