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

covering radiusbinary codeminimum cardinality

Mathematics Subject Classification ID

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

Recommendations

• Improved lower bounds on \(m_r(2,29)\)
• An improvement on the bound for \(C_2 (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)