By Topic

New binary covering codes obtained by simulated annealing

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

1 Author(s)
Wille, L.T. ; Dept. of Phys., Florida Atlantic Univ., Boca Raton, FL, USA

New binary covering codes of radius 1, obtained by simulated annealing, are presented. These constructions establish that K(9, 1)⩽62 and K(12, 1)⩽380. The article is concerned with finding upper bounds on K(n,R), the minimum cardinality of any binary code of length n and with covering radius R

Published in:

Information Theory, IEEE Transactions on  (Volume:42 ,  Issue: 1 )