On a construction of easily decodable sub-de~Bruijn arrays
Diskretnyj analiz i issledovanie operacij, Tome 26 (2019) no. 2, pp. 98-114

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider a two-dimensional generalization of de Bruijn sequences; i.e., 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. Bibliogr. 16.
Mots-clés : de Bruijn sequence, de Bruijn array
Keywords: decoding, complexity.
@article{DA_2019_26_2_a4,
     author = {D. A. Makarov and A. D. Yashunsky},
     title = {On a construction of easily decodable {sub-de~Bruijn} arrays},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {98--114},
     publisher = {mathdoc},
     volume = {26},
     number = {2},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2019_26_2_a4/}
}
TY  - JOUR
AU  - D. A. Makarov
AU  - A. D. Yashunsky
TI  - On a construction of easily decodable sub-de~Bruijn arrays
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2019
SP  - 98
EP  - 114
VL  - 26
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2019_26_2_a4/
LA  - ru
ID  - DA_2019_26_2_a4
ER  - 
%0 Journal Article
%A D. A. Makarov
%A A. D. Yashunsky
%T On a construction of easily decodable sub-de~Bruijn arrays
%J Diskretnyj analiz i issledovanie operacij
%D 2019
%P 98-114
%V 26
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2019_26_2_a4/
%G ru
%F DA_2019_26_2_a4
D. A. Makarov; A. D. Yashunsky. On a construction of easily decodable sub-de~Bruijn arrays. Diskretnyj analiz i issledovanie operacij, Tome 26 (2019) no. 2, pp. 98-114. http://geodesic.mathdoc.fr/item/DA_2019_26_2_a4/