By Topic

On the size of optimal binary codes of length 9 and covering radius 1

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Ostergard, P.R.J. ; Dept. of Comput. Sci. & Eng., Helsinki Univ. of Technol., Espoo, Finland ; Blass, U.

The minimum number of codewords in a binary code with length n and covering radius R is denoted by K(n, R). The values of K(n, 1) are known up to length 8, and the corresponding optimal codes have been classified. It is known that 57⩽K(9, 1)⩽62. In the current work, the lower bound is improved to settle K(9, 1)=62. In the approach, which is computer-aided, possible distributions of codewords in subspaces are refined until each subspace is of dimension zero (consists of only one word). Repeatedly, a linear programming problem is solved considering only inequivalent distributions. A connection between this approach and weighted coverings is also presented; the computations give new results for such coverings as a by-product

Published in:

Information Theory, IEEE Transactions on  (Volume:47 ,  Issue: 6 )