Lecture Notes in Computer Science, No. 781, pp. 51-55, Springer-Verlag, 1994.
Antoine LOBSTEIN
Centre National de la Recherche Scientifique
Ecole Nationale Supérieure des Télécommunications
46 rue Barrault, 75634 Paris cédex 13, France
&
Vera PLESS
University of Illinois at Chicago
Chicago, IL 60680, Etats-Unis d'Amérique
Abstract. We give a table with the most current available information for the shortest length of a binary code with codimension m and covering radius r for 1 < m < 25 and 1 < r < 13.