Perfect Factors from Cyclic Codes and Interleaving

DOI10.1137/S089548019630649XMaRDI QIDQ4388991zbMATH OpenOpenAlexFDO

Authors Kenneth G. Paterson, Chris J. Mitchell

Publication date 11 May 1998

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

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

zbMATH Keywords

cyclic codesde Bruijn graphde Bruijn sequenceinterleavingLempel homomorphismperfect factorswindow sequencewindow sizes

Mathematics Subject Classification ID

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

Recommendations

• Constructing \(c\)-ary perfect factors
• Constructions for higher dimensional perfect multifactors
• De Bruijn Sequences and Perfect Factors
• scientific article; zbMATH DE number 503208

Cited in

(2)

• Constructing \(c\)-ary perfect factors
• Constructions for higher dimensional perfect multifactors

This page was built for publication: Perfect Factors from Cyclic Codes and Interleaving

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