On a Construction of Easily Decodable Sub-de Bruijn Arrays

DOI10.1134/S1990478919020091zbMath1438.94051OpenAlexW2950695510WikidataQ127702050 ScholiaQ127702050MaRDI QIDQ4973253

No author found.

Publication date: 2 December 2019

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478919020091

zbMATH Keywords

complexitydecodingde Bruijn sequencede Bruijn array

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the de Bruijn torus problem
• Locating patterns in the de Bruijn torus
• Decoding perfect maps
• De Bruijn sequences with efficient decoding algorithms
• New classes of perfect maps. I
• New classes of perfect maps. II
• A new construction of two-dimensional arrays with the window property
• Robust positioning patterns
• Aperiodic and semi-periodic perfect maps
• Simple and Robust Binary Self-Location Patterns
• Sequence Folding, Lattice Tiling, and Multidimensional Coding

This page was built for publication: On a Construction of Easily Decodable Sub-de Bruijn Arrays