New binary covering codes obtained by simulated annealing

DOI10.1109/18.481808MaRDI QIDQ4880021zbMATH OpenOpenAlexFDO

Authors 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

binary codescovering radiussimulated annealing

Mathematics Subject Classification ID

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

Recommendations

• New upper bounds for binary covering codes
• New constructions for q-ary covering codes
• Constructing covering codes with given automorphisms
• Some new lower bounds for binary and ternary covering codes
• On the size of optimal binary codes of length 9 and covering radius 1

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4880021)