Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR

DOI10.1016/j.ffa.2019.101574zbMath1427.94075OpenAlexW2969020780MaRDI QIDQ2007704

Tian Tian, Lin-Lin Zhou, Wen-Feng Qi, Zhong-Xiao Wang

Publication date: 22 November 2019

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2019.101574

zbMATH Keywords

de Bruijn sequencesnonlinear feedback shift registersconjugate states

Mathematics Subject Classification ID

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

Related Items (1)

On the \(k\)-error linear complexities of De Bruijn sequences

Uses Software

• Grain

Cites Work

• Unnamed Item
• Unnamed Item
• New stream cipher designs. The eSTREAM finalists
• De Bruijn sequences, irreducible codes and cyclotomy
• Generation of some de Bruijn sequences
• Construction for de Bruijn sequences with large stage
• Stretching de Bruijn sequences
• On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
• Construction of de Bruijn Sequences From LFSRs With Reducible Characteristic Polynomials
• 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
• Algorithms for the generation of full-length shift- register sequences
• Linear Complexity and Random Sequences
• On the cycle structure of some nonlinear shift register sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• An efficient implementation of the D-homomorphism for generation of de Bruijn sequences
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

This page was built for publication: Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR