De Bruijn Sequences and Perfect Factors

DOI10.1137/S0895480195290911MaRDI QIDQ4337745zbMATH OpenOpenAlexFDO

Authors Chris J. Mitchell

Publication date 26 May 1997

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480195290911

zbMATH Keywords

de Bruijn sequencede Bruijn graphperfect factorwindow sequence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Communication, information (94A99)

Recommendations

• A method for constructing decodable de Bruijn sequences
• De Bruijn sequences with efficient decoding algorithms
• Storage efficient decoding for a class of binary de Bruijn sequences
• A recursive construction of nonbinary de Bruijn sequences

Cited in

(5)

• De Bruijn sequences with efficient decoding algorithms
• Robust positioning patterns
• scientific article; zbMATH DE number 4181282 (Why is no real title available?)
• Projective de Bruijn Sequences
• On semi-perfect de Bruijn words

This page was built for publication: De Bruijn Sequences and Perfect Factors

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