On a Construction of Easily Decodable Sub-de Bruijn Arrays
- Authors: Makarov D.A.1, Yashunsky A.D.1,2
-
Affiliations:
- Keldysh Institute of Applied Mathematics
- Lomonosov Moscow State University
- Issue: Vol 13, No 2 (2019)
- Pages: 280-289
- Section: Article
- URL: https://journals.rcsi.science/1990-4789/article/view/213176
- DOI: https://doi.org/10.1134/S1990478919020091
- ID: 213176
Cite item
Abstract
We consider the two-dimensional generalizations of de Bruijn sequences; i.e., the integer-valued arrays whose all fragments of a fixed size (windows) are different. For these arrays, dubbed sub-de Bruijn, we consider the complexity of decoding; i.e., the determination of a position of a window with given content in an array. We propose a construction of arrays of arbitrary size with arbitrary windows where the number of different elements in the array is of an optimal order and the complexity of decoding a window is linear.
Keywords
About the authors
D. A. Makarov
Keldysh Institute of Applied Mathematics
Author for correspondence.
Email: m8er_ed@mail.ru
Russian Federation, Miusskaya pl. 4, Moscow, 125047
A. D. Yashunsky
Keldysh Institute of Applied Mathematics; Lomonosov Moscow State University
Author for correspondence.
Email: yashunsky@keldysh.ru
Russian Federation, Miusskaya pl. 4, Moscow, 125047; Leninskie gory 1, Moscow, 119991