\(K_{5}(7,3) \leqslant 100\).

DOI10.1016/j.jcta.2003.08.004zbMath1036.94018OpenAlexW2017783420MaRDI QIDQ1421340

Guillaume Gommard, Alain Plagne

Publication date: 26 January 2004

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2003.08.004

zbMATH Keywords

Simulated annealingGroup of automorphismsCovering code

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• Local search in coding theory
• Constructing covering codes with given automorphisms
• New upper bounds for the football pool problem for 11 and 12 matches
• New upper bounds for binary covering codes
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• Upper bounds for q-ary covering codes
• New binary covering codes obtained by simulated annealing
• Bounds on codes over an alphabet of five elements

This page was built for publication: \(K_{5}(7,3) \leqslant 100\).