2000 character limit reached
On de Bruijn Covering Sequences and Arrays
Published 21 Apr 2024 in cs.IT and math.IT | (2404.13674v2)
Abstract: An $(m,n,R)$-de Bruijn covering array (dBCA) is a doubly periodic $M \times N$ array over an alphabet of size $q$ such that the set of all its $m \times n$ windows form a covering code with radius $R$. An upper bound of the smallest array area of an $(m,n,R)$-dBCA is provided using a probabilistic technique which is similar to the one that was used for an upper bound on the length of a de Bruijn covering sequence. A folding technique to construct a dBCA from a de Bruijn covering sequence or de Bruijn covering sequences code is presented. Several new constructions that yield shorter de Bruijn covering sequences and $(m,n,R)$-dBCAs with smaller areas are also provided. These constructions are mainly based on sequences derived from cyclic codes, self-dual sequences, primitive polynomials, an interleaving technique, folding, and mutual shifts of sequences with the same covering radius. Finally, constructions of de Bruijn covering sequences codes are also discussed.
- N. G. De Bruijn, “A combinatorial problem," Proceedings of the Section of Sciences of the Koninklijke Nederlandse Akademie van Wetenschappen te Amsterdam, vol. 49, no. 7, pp. 758–764, 1946.
- I. G. Good, “Normally recurring decimals," J. London Math. Soc., vol. 21, pp. 167–169, 1946.
- T. van Aardenne-Ehrenfest and N. G. de Bruijn, “Circuits and trees in ordered linear graphs," Simon Steven, vol. 28, pp. 203–217, 1951.
- A. Lempel and M. Cohn, “Design of universal test sequences for vlsi,” IEEE Transactions on Information Theory, vol. 31, no. 1, pp. 10–17, 1985.
- S. W. Golomb, “Shift register sequences: secure and limited-access code generators, efficiency code generators, prescribed property generators, mathematical models" World Scientific, 2017.
- A. M. Bruckstein, T. Etzion, R. Giryes, N. Gordon, R. J. Holt, and D. Shuldiner, “Simple and robust binary self-location patterns," IEEE Transactions on Information Theory, vol. 58, no. 7, pp. 4884–4889, 2012.
- M. R. Samatham and D. K. Pradhan, “The de bruijn multiprocessor network: a versatile parallel processing and sorting network for vlsi," IEEE Transactions on Computers, vol. 38, no. 4, pp. 567–581, 1989.
- Y. M. Chee, D. T. Dao, T. L. Nguyen, D. H. Ta, and V. K. Vu, “Run length limited de bruijn sequences for quantum communications," in 2022 IEEE International Symposium on Information Theory (ISIT), pp. 264–269, 2022.
- J. Pages, J. Salvi, C. Collewet, and J. Forest, “Optimised de bruijn patterns for one-shot shape acquisition," Image and Vision Computing, vol. 23, no. 8, pp. 707–720, 2005.
- M. Krivelevich, B. Sudakov, and V. H. Vu, “Covering codes with improved density," IEEE Transactions on Information Theory, vol. 49, no. 7, pp. 1812–1815, 2003.
- R. Smolensky, “On representations by low-degree polynomials,” in Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, pp. 130–138, 1993.
- R. Pagh, “Locality-sensitive hashing without false negatives," in Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, pp. 1–9, 2016.
- F. Afrati, A. D. Sarma, A. Rajaraman, P. Rule, S. Salihoglu, and J. Ullman, “Anchor points algorithms for hamming and edit distance," in Proceedings of ICDT, 2014.
- A. Lenz, C. Rashtchian, P. H. Siegel, and E. Yaakobi, “Covering codes using insertions or deletions," IEEE Transactions on Information Theory, vol. 67, no. 6, pp. 3376–3388, 2020.
- F. Chung and J. N. Cooper, “De bruijn cycles for covering codes," Random Structures & Algorithms, vol. 25, no. 4, pp. 421–431, 2004.
- V. Vu, “De bruijn covering codes with arbitrary alphabets," Advances in Applied Mathematics, vol. 34, no. 1, pp. 65–70, 2005.
- R. M. Roth, “Maximum-rank array codes and their application to crisscross error correction," IEEE Transactions on Information Theory, vol. 37, no. 2, pp. 328–336, 1991.
- I. Tal, T. Etzion, and R. Roth, “On row-by-row coding for 2d constraints," IEEE Transactions on Information Theory, vol. 55, no. 8, pp. 3565–3576, 2009.
- T. Etzion, “Constructions for perfect maps and pseudorandom arrays," IEEE Transactions on Information Theory, vol. 34, no. 5, pp. 1308–1316, 1988.
- K. G. Paterson, “Perfect maps," IEEE Transactions on Information Theory, vol. 40, no. 3, pp. 743–753, 1994.
- F. J. MacWilliams and N. J. A. Sloane, “Pseudo-random sequences and arrays," Proceedings of the IEEE, vol. 64, pp. 1715–1729, 1976.
- R. A. Morano, C. Ozturk, R. Conn, S. Dubin, S. Zietz, and J. Nissano, “Structured light using pseudorandom codes," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 3, pp. 322–327, 1998.
- S. Janson, “New versions of suen’s correlation inequality," Random Structures and Algorithms, vol. 13, no. 3–4, pp. 467–483, 1998.
- R. Dougherty and H. Janwa, “Covering radius computations for binary cyclic codes," Mathematics of computation, vol. 57, no. 195, pp. 415–434, 1991.
- D. Downie and N. Sloane, “The covering radius of cyclic codes of length up to 31 (corresp.)," IEEE Transactions on Information Theory, vol. 31, no. 3, pp. 446–447, 1985.
- H. Janwa, “Some new upper bounds on the covering radius of binary linear codes," IEEE Transactions on Information Theory, vol. 35, no. 1, pp. 110–122, 1989.
- S. Kavut and S. Tutdere, “The covering radii of a class of binary cyclic codes and some bch codes," Designs, Codes and Cryptography, vol. 87, no. 2-3, pp. 317–325, 2019.
- T. Etzion and A. Lempel, “Construction of de bruijn sequences of minimal complexity," IEEE Transactions on Information Theory, vol. 30, no. 5, pp. 705–709, 1984.
- T. Etzion and K. G. Paterson, “Near optimal single-track gray codes," IEEE Transactions on Information Theory, vol. 42, no. 3, pp. 779–789, 1996.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.