The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials

DOI10.1109/TIT.2016.2634420MaRDI QIDQ2989661zbMATH OpenOpenAlexWikidataFDO

Authors Ming Li, Dongdai Lin

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Applications of graph theory to circuits and networks (94C15)

Cited in

(6)

• The adjacency graphs of FSRs with a class of affine characteristic functions
• Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• Properties of the cycles that contain all vectors of weight k
• 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: The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials

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