New lower bounds for binary covering codes

DOI10.1109/18.335963MaRDI QIDQ4324172zbMATH OpenOpenAlexFDO

Authors Dongfeng Li, Wende Chen

Publication date 1 March 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.335963

zbMATH Keywords

\(R\)-excessbinary codecovering codescovering radiuslower boundsmultiexcess

Mathematics Subject Classification ID

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

Recommendations

• Linear inequalities for covering codes. I. Pair covering inequalities
• Some new lower bounds for binary and ternary covering codes
• New upper bounds for binary covering codes
• New lower bounds for covering codes
• New lower bounds for covering codes

Cited in

(17)

• Bounds for binary multiple covering codes
• On lower bounds for covering codes
• New upper bounds for binary covering codes
• Some new lower bounds for ternary covering codes
• Critical problem for codes over finite chain rings
• Optimal binary covering codes of length 2j
• New lower bounds for asymmetric covering codes
• Lower bounds for q-ary covering codes
• Some new lower bounds for binary and ternary covering codes
• An improvement of the Van Wee bound for binary linear covering codes
• New lower bounds on aperiodic crosscorrelation of binary codes
• Modified bounds for covering codes
• On the general excess bound for binary codes with covering radius one
• On the general excess bound for binary codes with covering radius one
• Improved lower bounds on the domination number of hypercubes and binary codes with covering radius one
• An initial polyhedral study of the football pool problem
• New bounds on binary identifying codes

This page was built for publication: New lower bounds for binary covering codes

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