A Class of de Bruijn Sequences

DOI10.1109/TIT.2014.2361522MaRDI QIDQ2979185zbMATH OpenOpenAlexFDO

Authors Chaoyun Li, Xiangyong Zeng, Chunlei Li, Tor Helleseth

Publication date 2 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2014.2361522

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Cited in

(18)

• The adjacency graphs of FSRs with a class of affine characteristic functions
• Construction of de Bruijn sequences from product of two irreducible polynomials
• On ideal t-tuple distribution of filtering de Bruijn sequence generators
• An interleaved method for constructing de Bruijn sequences
• A framework for constructing de Bruijn sequences via simple successor rules
• The minimal polynomials of modified de Bruijn sequences revisited
• New results on the minimal polynomials of modified de Bruijn sequences
• Multi de Bruijn sequences
• Construction for de Bruijn sequences with large stage
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• scientific article; zbMATH DE number 5016615 (Why is no real title available?)
• Projective de Bruijn Sequences
• de Bruijn notation as a nested datatype
• DE BRUIJN SEQUENCES REVISITED
• Constructing de Bruijn sequences based on a new necessary condition
• The adjacency graphs of some feedback shift registers
• Generalized cycle joining method and its application to the construction of long-period Galois NFSRs
• Longest subsequences shared by two de Bruijn sequences

This page was built for publication: A Class of de Bruijn Sequences

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