New binary covering codes obtained by simulated annealing

New binary covering codes of radius 1, obtained by simulated annealing, are presented. These constructions establish that K(9, 1)/spl les/62 and K(12, 1)/spl les/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 coverin...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 1996-01, Vol.42 (1), p.300-302
Main Author: Wille, L.T.
Format: Article
Language:English
Subjects:
Binary codes
Binary system
Codes
Cost function
Design optimization
Error correction codes
Optimization methods
Physics
Simulated annealing
Simulation
Temperature
Upper bound
Writing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:New binary covering codes of radius 1, obtained by simulated annealing, are presented. These constructions establish that K(9, 1)/spl les/62 and K(12, 1)/spl les/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.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.481808