New binary covering codes obtained by simulated annealing

DOI10.1109/18.481808zbMath0851.94031OpenAlexW2138596787MaRDI QIDQ4880021

Luc T. Wille

Publication date: 29 July 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.481808

zbMATH Keywords

covering radiussimulated annealingbinary codes

Mathematics Subject Classification ID

Bounds on codes (94B65) Parallel algorithms in computer science (68W10) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Related Items (5)

New upper bounds for binary covering codes ⋮ Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one ⋮ \(K_{5}(7,3) \leqslant 100\). ⋮ Switching codes and designs ⋮ An improved lower bound on the covering number \(K_2(9,1)\)

This page was built for publication: New binary covering codes obtained by simulated annealing