A method for constructing decodable de Bruijn sequences

DOI10.1109/18.532887zbMath0857.94012OpenAlexW2125077729MaRDI 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

zbMATH Keywords

de Bruijn sequenceswindowdecoding algorithms

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Decoding (94B35)

Related Items (5)

An interleaved method for constructing de Bruijn sequences ⋮ Digital Geometry in Image-Based Metrology ⋮ Robust Positioning Patterns with Low Redundancy ⋮ Efficient Ranking of Lyndon Words and Decoding Lexicographically Minimal de Bruijn Sequence ⋮ Constructing de Bruijn Sequences Based on a New Necessary Condition

This page was built for publication: A method for constructing decodable de Bruijn sequences