De Bruijn Sequences and Perfect Factors

DOI10.1137/S0895480195290911zbMATH Open0867.05053OpenAlexW2022430421MaRDI QIDQ4337745FDOQ4337745

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

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

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)

Cited In (3)

• De Bruijn sequences with efficient decoding algorithms
• Title not available (Why is that?)
• Projective de Bruijn Sequences

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)