De Bruijn sequences, irreducible codes and cyclotomy

Discrete Mathematics

Volumn 159, Issue 1-3, 1996, Pages 143-154

  Hauge, Erik R ^a   Helleseth, Tor ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038944913     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(96)00106-9     Document Type: Article

References (10)

1. L.D. Baumert and R.J. McEliece, Weights of irreducible cyclic codes, Inform. Control 20 (1972) 159-175.
2. C. Berge, The Theory of Graphs and its Applications (Methuen & Co Ltd., London, 1962).
3. H. Fredricksen, A survey of full length nonlinear shift register cycle algorithms, SIAM Rev. 24 (1982) 195-221.
4. S.W. Golomb, Shift Register Sequences (Aegean Park Press, Laguna Hills, CA, 1982).
5. E.R. Hauge and J. Mykkeltveit, On the classification of de Bruijn sequences. Discrete Math. 148 (1996) 65-83.
6. C.J.A. Jansen, W.G. Franx and D.E. Boekee, An efficient algorithm for the generation of de Bruijn cycles, IEEE Trans. Inform Theory 37 (1991) 1475-1478.
7. R. Lidl and H. Niederreiter, Finite Fields (Addison-Wesley Publishing Company, Reading MA, 1983).
8. F.J. Mac Williams and N.J. A. Sloane, The Theory of Error Correcting Codes (Elsevier/North-Holland, New York, 1977).
9. E. Selmer, Linear Recurrence Relations Over Finite Fields, Dept. of Mathematics, University of Bergen, Norway, 1966.
10. T. Storer, Cyclotomy and Difference Sets (Markham Publishing Company, Chicago, 1967).