An improved sphere covering bound for the codes with n=3R+2

DOI10.1109/18.59951zbMATH Open0713.94022OpenAlexW2149625001MaRDI QIDQ3199336FDOQ3199336

Authors: Xiang-Dong Hou 

Publication date: 1990

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

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

Recommendations

• Improved sphere bounds on the covering radius of codes
• New lower bounds for covering codes
• Some new lower bounds for binary and ternary covering codes
• scientific article; zbMATH DE number 4108663
• New bounds for linear codes of covering radii 2 and 3

zbMATH Keywords

covering radiusbinary codeminimal distancesphere covering bound

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cited In (6)

• Minimal coverings of \({\{0, 1, 2\}}^n\) with spheres of radius \(n\)
• New lower bounds for covering codes
• Title not available (Why is that?)
• Inequalities for covering codes
• Improved sphere bounds on the covering radius of codes
• Bounds for binary multiple covering codes

This page was built for publication: An improved sphere covering bound for the codes with n=3R+2

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