On cross joining de Bruijn sequences

DOI10.1090/CONM/632/12637MaRDI QIDQ3187300zbMATH OpenOpenAlexFDO

Authors Johannes Mykkeltveit, Janusz Szmidt

Publication date 2 September 2016

Published in Topics in Finite Fields (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/30494e214e5229b3f0065044155e7d023884097d

zbMATH Keywords

cross-join pairsde Bruijn sequencesmaximum periodnonlinear feedback shift registersquadratic \(m\)-sequences

Mathematics Subject Classification ID

Boolean functions (06E30) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• Cryptographically Strong de Bruijn Sequences with Large Periods
• An interleaved method for constructing de Bruijn sequences
• Clues to the hidden nature of de Bruijn sequences
• Characterizations of generators for modified de Bruijn sequences

Cited in

(9)

• Construction of de Bruijn sequences from product of two irreducible polynomials
• On ideal t-tuple distribution of filtering de Bruijn sequence generators
• On the \(k\)-error linear complexities of De Bruijn sequences
• Construction for de Bruijn sequences with large stage
• Searching for nonlinear feedback shift registers with parallel computing
• The number of cross-join pairs in maximum length linear sequences
• The adjacency graphs of some feedback shift registers
• On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
• Longest subsequences shared by two de Bruijn sequences

This page was built for publication: On cross joining de Bruijn sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187300)