On a construction of easily decodable sub-de Bruijn arrays
From MaRDI portal
Publication:4973253
Recommendations
Cites work
- scientific article; zbMATH DE number 721894 (Why is no real title available?)
- scientific article; zbMATH DE number 721906 (Why is no real title available?)
- scientific article; zbMATH DE number 1409226 (Why is no real title available?)
- scientific article; zbMATH DE number 3095523 (Why is no real title available?)
- A new construction of two-dimensional arrays with the window property
- Aperiodic and semi-periodic perfect maps
- De Bruijn sequences with efficient decoding algorithms
- Decoding perfect maps
- Locating patterns in the de Bruijn torus
- New classes of perfect maps. I
- New classes of perfect maps. II
- On the de Bruijn torus problem
- Robust positioning patterns
- Sequence Folding, Lattice Tiling, and Multidimensional Coding
- Simple and Robust Binary Self-Location Patterns
Cited in
(6)- Locating patterns in the de Bruijn torus
- A note on binary arrays with a certain window property (Corresp.)
- scientific article; zbMATH DE number 1409226 (Why is no real title available?)
- Storage efficient decoding for a class of binary de Bruijn sequences
- Construction of infinite de Bruijn arrays
- A new construction of two-dimensional arrays with the window property
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)