De Bruijn Cycles for Covering Codes

Details De Bruijn Cycles for Covering Codes De Bruijn Cycles for Covering Codes

2003-10-24

arxiv.org/abs/math/0310385v2

Mathematics

Combinatorics

18 pages, 0 figures, submitted to RSA

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

De Bruijn Cycles for Covering Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with De Bruijn Cycles for Covering Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and De Bruijn Cycles for Covering Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-342663