De Bruijn sequences, irreducible codes and cyclotomy

DOI10.1016/0012-365X(96)00106-9zbMath0878.94046OpenAlexW2007799433MaRDI QIDQ1126191

Tor Helleseth, Erik R. Hauge

Publication date: 16 November 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(96)00106-9

zbMATH Keywords

de Bruijn sequencescyclotomic numbersirreducible polynomialsadjacency graphsfeedback functions

Mathematics Subject Classification ID

Applications of graph theory (05C90) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (9)

The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ Construction of de Bruijn sequences from product of two irreducible polynomials ⋮ The minimal polynomials of modified de Bruijn sequences revisited ⋮ Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR ⋮ New results on the minimal polynomials of modified de Bruijn sequences ⋮ New generalized cyclotomy and its applications ⋮ On cyclotomic generator of order \(r\).

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the classification of deBruijn sequences
• An efficient algorithm for the generation of DeBruijn cycles
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Weights of irreducible cyclic codes

This page was built for publication: De Bruijn sequences, irreducible codes and cyclotomy