On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials

DOI10.1007/s10623-018-0509-yzbMath1439.11055arXiv1611.10088OpenAlexW2558285393WikidataQ129617477 ScholiaQ129617477MaRDI QIDQ2414937

San Ling, Huaxiong Wang, Zuling Chang, Martianus Frederic Ezerman

Publication date: 17 May 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.10088

zbMATH Keywords

cycle structurede Bruijn sequenceLFSRadjacency graphcyclotomic numberbinary periodic sequence

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Sequences (mod (m)) (11B50)

Related Items (3)

The minimal polynomials of modified de Bruijn sequences revisited ⋮ Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR ⋮ On greedy algorithms for binary de Bruijn sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The adjacency graphs of some feedback shift registers
• De Bruijn sequences, irreducible codes and cyclotomy
• A class of nonlinear de Bruijn cycles
• The cycle structure of LFSR with arbitrary characteristic polynomial over finite fields
• Construction of de Bruijn sequences from product of two irreducible polynomials
• On the classification of deBruijn sequences
• A proof of Golomb's conjecture for the de Bruijn graph
• Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
• A Class of de Bruijn Sequences
• The Properties of a Class of Linear FSRs and Their Applications to the Construction of Nonlinear FSRs
• The Adjacency Graphs of LFSRs With Primitive-Like Characteristic Polynomials
• Adjacencies Between the Cycles of a Shift Register with Characteristic Polynomial (1 + x)ⁿ
• Algorithms for the generation of full-length shift- register sequences
• Shift Register Sequences – A Retrospective Account
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science
• A relationship between linear complexity and k-error linear complexity
• Simple and Robust Binary Self-Location Patterns

This page was built for publication: On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials