GUAVA computations with the covering radius of (binary) cyclic codes

This is a web page motivated by the Problem in section 5 of N. Sloane's Unsolved problems related to the covering radius of codes. Link to pdf file (see also paper #130 on his page of papers and see his covering radius page).

This web page is under construction and the following tables are incomplete.

n=35
n=36
n=37

Related web pages:

Table of the best currently known lower and upper bounds on the smallest size of a covering code, by Simon Litsyn. Has tables with the best known bounds on the size of binary covering codes of length up to 33 and covering radius up to 10.
Tables of the best known lower and upper bounds on the smallest size of a covering code. Has results for non-binary codes.

David Joyner / Last modified: 3-19-2008