De Bruijn cycles for covering codes

A de Bruijn covering code is a q-ary string S so that every q-ary string is at most R symbol changes from some n-word appearing consecutively in S. We introduce these codes and prove that they can have length close to the smallest possible covering code. The proof employs tools from field theory, probability, and linear algebra. We also prove a number of ``spectral'' results on de Bruijn covering codes. Included is a table of the best known bounds on the lengths of small binary de Bruijn covering codes, up to R=11 and n=13, followed by several open questions in this area.

[1]  Gérard D. Cohen,et al.  Covering Codes , 2005, North-Holland mathematical library.

[2]  Benny Sudakov,et al.  Covering codes with improved density , 2003, IEEE Transactions on Information Theory.

[3]  J. T. Beard.  Matrix fields, regular and irregular: A complete fundamental characterization , 1986 .

[4]  Joshua N. Cooper,et al.  Asymmetric Binary Covering Codes , 2002, J. Comb. Theory, Ser. A.

[5]  Max Landsberg,et al.  Feedback functions for generating cycles over a finite alphabet , 2000, Discret. Math..

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[8]  H. Fredricksen.  A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .

[9]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[10]  W. V. Parker.  The matrix equation $AX=XB$ , 1950 .