A method for constructing decodable de Bruijn sequences
From MaRDI portal
Publication:4896825
DOI10.1109/18.532887zbMath0857.94012MaRDI QIDQ4896825
Kenneth G. Paterson, Tuvi Etzion, Chris J. Mitchell
Publication date: 22 October 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.532887
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
94B35: Decoding
Related Items
Digital Geometry in Image-Based Metrology, Constructing de Bruijn Sequences Based on a New Necessary Condition, Robust Positioning Patterns with Low Redundancy, An interleaved method for constructing de Bruijn sequences, Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence