Asymptotic minimum covering radius of block codes

DOI10.1137/S0895480100379993zbMATH Open0982.94031OpenAlexW2156118234MaRDI QIDQ2753545FDOQ2753545

Authors Poning Chen, Yunghsiang Sam Han

Publication date 11 November 2001

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480100379993

zbMATH Keywords

covering radiusblock codesinformation spectrumspectrum formulacodeword-selecting distributions

Mathematics Subject Classification ID

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

Recommendations

• On the covering radius of codes
• Asymptotic bounds on the covering radius of binary codes
• scientific article; zbMATH DE number 1284421
• Covering radius---Survey and recent results
• On upper bounds for minimum distance and covering radius of non-binary codes

Cited in

(2)

• Distance-spectrum formulas on the largest minimum distance of block codes
• The packing radius of a poset block code

This page was built for publication: Asymptotic minimum covering radius of block codes

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