An improved lower bound on the covering number K₂(9,1)

DOI10.1016/S0012-365X(99)90103-6MaRDI QIDQ1292854zbMATH OpenOpenAlexFDO

Authors Raymond Hill, Emil Kolev

Publication date 6 April 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)90103-6

zbMATH Keywords

binary codecovering radiusminimum cardinality

Mathematics Subject Classification ID

Other types of codes (94B60) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Review text

Here the authors improve the lower bound for \(K_2(9,1)\), the minimum cardinality of a binary code of length 9 and covering radius 1 in showing that a binary code of length 9, 55 codewords and covering radius 1 does not exist giving the new lower bound \(K_2(9,1)\geq 56\). In a later paper they obtain the bound 57 (see the following review Zbl 0933.94040). The best upper bound \(K(9)\leq 62\) has been obtained by L. T. Wille.

Recommendations

• Improved lower bounds on \(m_r(2,29)\)
• An improvement on the bound for C₂ (n)
• The covering numbers of \(\mathbb{A}_9\) and \(\mathbb{A}_{11}\)
• A lower bound for \(K^2_S\)
• New lower bounds for multiple coverings
• scientific article; zbMATH DE number 5233136
• Improved Bounds for the Crossing Numbers of Km,n and Kn
• scientific article; zbMATH DE number 3987288
• scientific article; zbMATH DE number 695425
• Upper bounds on the general covering numberC_λ(v,k,t,m)

Cites work

• Covering radius 1985-1994
• New binary covering codes obtained by simulated annealing

This page was built for publication: An improved lower bound on the covering number \(K_2(9,1)\)

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