Title :
New binary covering codes obtained by simulated annealing
Author_Institution :
Dept. of Phys., Florida Atlantic Univ., Boca Raton, FL, USA
fDate :
1/1/1996 12:00:00 AM
Abstract :
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
Keywords :
binary sequences; codes; simulated annealing; binary covering codes; code length; minimum cardinality; simulated annealing; upper bounds; Binary codes; Cost function; Design optimization; Error correction codes; Optimization methods; Physics; Simulated annealing; Temperature; Upper bound; Writing;
Journal_Title :
Information Theory, IEEE Transactions on