New classes of perfect maps. I

DOI10.1016/S0097-3165(96)80008-2zbMath0841.94027OpenAlexW4210645430MaRDI QIDQ1906142

Kenneth G. Paterson

Publication date: 26 February 1996

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0097-3165(96)80008-2

zbMATH Keywords

de Bruijn sequencesde Bruijn arrayde Bruijn toriexistence of perfect maps

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (2)

New classes of perfect maps. II ⋮ On a Construction of Easily Decodable Sub-de Bruijn Arrays

Cites Work

• On the de Bruijn torus problem
• Notes on de Bruijn sequences
• Toroidal tilings from de Bruijn-Good cyclic sequences
• Some VLSI decompositions of the de Bruijn graph
• Universal cycles for combinatorial structures
• Decoding perfect maps
• Constructing \(c\)-ary perfect factors
• Perfect factors in the de Bruijn graph
• On Codes With Low Peak-to-Average Power Ratio for Multicode CDMA
• A note on binary arrays with a certain window property (Corresp.)
• An algorithm for constructing m-ary de Bruijn sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• Constructions for perfect maps and pseudorandom arrays
• Perfect maps
• Fault-tolerant networks based on the de Bruijn graph
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New classes of perfect maps. I