Linear complexity of de Bruijn sequences-old and new results

DOI10.1109/18.749013zbMath0946.94021OpenAlexW2156732823MaRDI QIDQ4701313

Tuvi Etzion

Publication date: 21 November 1999

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

Full work available at URL: https://semanticscholar.org/paper/04f2d1c2d5d83699903cfa89ee7980b601c50cd0

zbMATH Keywords

linear complexityde Bruijn sequencecomplexity distribution

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (8)

Preliminary results on the minimal polynomial of modified de Bruijn sequences ⋮ The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation ⋮ Sequences with good correlation property based on depth and interleaving techniques ⋮ Minimal polynomials of the modified de Bruijn sequences ⋮ The minimal polynomials of modified de Bruijn sequences revisited ⋮ On the \(k\)-error linear complexities of De Bruijn sequences ⋮ Longest subsequences shared by two de Bruijn sequences ⋮ Minimal Polynomials of the Modified de Bruijn Sequences

This page was built for publication: Linear complexity of de Bruijn sequences-old and new results