K₅(7,3) 100.

DOI10.1016/J.JCTA.2003.08.004MaRDI QIDQ1421340zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 4202303
• scientific article; zbMATH DE number 1156688
• On the order of \(\mathcal U(\mathbb{F}_{2k}D_{10})\) when \(5\mid(2^k-1)\).
• \(R(C_6,K_5)=21\) and \(R(C_7,K_5)=25\)
• Achromatic Number of K 5 × K n for Small n
• scientific article; zbMATH DE number 5901202
• scientific article; zbMATH DE number 2145228
• An extremal problem for subdivisions ofK?5
• On the existence of \(S(3,\{4,5,7\},v)\)

Cites work

• scientific article; zbMATH DE number 1229706 (Why is no real title available?)
• scientific article; zbMATH DE number 1024657 (Why is no real title available?)
• Bounds on codes over an alphabet of five elements
• Constructing covering codes with given automorphisms
• Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
• Local search in coding theory
• New binary covering codes obtained by simulated annealing
• New constructions for \(q\)-ary covering codes
• New upper bounds for binary covering codes
• New upper bounds for the football pool problem for 11 and 12 matches
• New upper bounds for the football pool problem for 6, 7, and 8 matches
• The football pool problem for 6 matches: A new upper bound obtained by simulated annealing
• Upper bounds for q-ary covering codes

Cited in

(1)

• LS[7](3,5,11( exists

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

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