Linear complexity of de Bruijn sequences-old and new results
From MaRDI portal
Publication:4701313
DOI10.1109/18.749013zbMATH Open0946.94021OpenAlexW2156732823MaRDI QIDQ4701313FDOQ4701313
Authors: 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
Recommendations
Combinatorics in computer science (68R05) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Cited In (14)
- Preliminary results on the minimal polynomial of modified de Bruijn sequences
- The minimal polynomials of modified de Bruijn sequences revisited
- Minimal polynomials of the modified de Bruijn sequences
- The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation
- Title not available (Why is that?)
- On the distribution of de Bruijn sequences of given complexity
- Minimal Polynomials of the Modified de Bruijn Sequences
- Linear spans of modified de Bruijn sequences
- On the \(k\)-error linear complexities of De Bruijn sequences
- Longest subsequences shared by two de Bruijn sequences
- ``Periods of de Bruijn sequences
- Sequences with good correlation property based on depth and interleaving techniques
- Construction of de Bruijn sequences of minimal complexity
- On the distribution of de Bruijn sequences of low complexity
This page was built for publication: Linear complexity of de Bruijn sequences-old and new results
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701313)
