On a construction of easily decodable sub-de Bruijn arrays
DOI10.1134/S1990478919020091zbMATH Open1438.94051OpenAlexW2950695510WikidataQ127702050 ScholiaQ127702050MaRDI QIDQ4973253FDOQ4973253
Authors:
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
Recommendations
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
- Title not available (Why is that?)
- Sequence Folding, Lattice Tiling, and Multidimensional Coding
- On the de Bruijn torus problem
- Locating patterns in the de Bruijn torus
- Simple and Robust Binary Self-Location Patterns
- New classes of perfect maps. II
- Title not available (Why is that?)
- Decoding perfect maps
- A new construction of two-dimensional arrays with the window property
- Title not available (Why is that?)
- Aperiodic and semi-periodic perfect maps
- De Bruijn sequences with efficient decoding algorithms
- New classes of perfect maps. I
- Robust positioning patterns
- Title not available (Why is that?)
Cited In (6)
- A new construction of two-dimensional arrays with the window property
- Locating patterns in the de Bruijn torus
- A note on binary arrays with a certain window property (Corresp.)
- Storage efficient decoding for a class of binary de Bruijn sequences
- Construction of infinite de Bruijn arrays
- Title not available (Why is that?)
This page was built for publication: On a construction of easily decodable sub-de Bruijn arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973253)
