Decoding perfect maps

DOI10.1007/BF01388557zbMath0794.94005MaRDI QIDQ1321553

Kenneth G. Paterson, Chris J. Mitchell

Publication date: 24 August 1994

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

zbMATH Keywords

de Bruijn sequencestwo-dimensional arraysdecoding problemperfect maps

Mathematics Subject Classification ID

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

Related Items

Constructing \(c\)-ary perfect factors ⋮ Perfect factors in the de Bruijn graph ⋮ New constructions for De Bruijn tori ⋮ New classes of perfect maps. I ⋮ New classes of perfect maps. II ⋮ On a Construction of Easily Decodable Sub-de Bruijn Arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Storage efficient decoding for a class of binary de Bruijn sequences
• A new construction of two-dimensional arrays with the window property
• A note on binary arrays with a certain window property (Corresp.)
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Constructions for perfect maps and pseudorandom arrays
• Perfect maps
• A theory of two-dimensional linear recurring arrays
• Normal Recurring Decimals
• Note on a Paper By I. J. Good