A method for constructing decodable de Bruijn sequences

DOI10.1109/18.532887MaRDI QIDQ4896825zbMATH OpenOpenAlexFDO

Authors Tuvi Etzion, Kenneth G. Paterson, 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 sequencesdecoding algorithmswindow

Mathematics Subject Classification ID

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

Recommendations

• De Bruijn Sequences and Perfect Factors
• De Bruijn sequences with efficient decoding algorithms
• Storage efficient decoding for a class of binary de Bruijn sequences
• On a construction of easily decodable sub-de Bruijn arrays

Cited in

(11)

• An interleaved method for constructing de Bruijn sequences
• Storage efficient decoding for a class of binary de Bruijn sequences
• Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence
• Cryptographically Strong de Bruijn Sequences with Large Periods
• De Bruijn Sequences and Perfect Factors
• Robust positioning patterns
• Digital geometry in image-based metrology
• On a construction of easily decodable sub-de Bruijn arrays
• Constructing de Bruijn sequences based on a new necessary condition
• Robust positioning patterns with low redundancy
• Orientable sequences over non-binary alphabets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896825)