The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials

DOI10.1109/TIT.2016.2634420zbMath1364.94819OpenAlexW2559395863WikidataQ59891794 ScholiaQ59891794MaRDI QIDQ2989661

Ming Li, Dong-Dai 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)

Related Items (5)

The adjacency graphs of FSRs with a class of affine characteristic functions ⋮ On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials ⋮ Properties of the cycles that contain all vectors of weight \(\le k\) ⋮ Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR ⋮ Longest subsequences shared by two de Bruijn sequences

This page was built for publication: The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials