A de Bruijn covering code of radius R is a binary string so that the set of words appearing as n consecutive symbols (wi
Statement
Chung/: A de Bruijn covering code of radius R is a binary string so that the set of words appearing as n consecutive symbols (with wrap-around) is a covering code of radius R. What is the smallest de Bruijn covering code with parameters R and n? It is known to be between c2^(n)/n^(R) and c2^(n) log n/n^(R).
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.