On the covering radius of subcodes of a code

DOI10.1109/18.104338MaRDI QIDQ3987472zbMATH OpenOpenAlexFDO

Authors Xiang-Dong Hou

Publication date 28 June 1992

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

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

zbMATH Keywords

binary linear codechromatic numbercovering radiussubcodeupper bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• On the covering radius of a code and its subcodes
• Subcodes and covering radius (Corresp.)
• scientific article; zbMATH DE number 3965968
• Another upper bound on covering radius
• An Upper Bound on Covering Radius

Cited in

(8)

• Covering bounds for codes
• scientific article; zbMATH DE number 4016768 (Why is no real title available?)
• Subcodes and covering radius (Corresp.)
• On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
• Another upper bound on covering radius
• Intersection of Hamming codes avoiding Hamming subcodes
• Covering radius and the chromatic number of Kneser graphs
• On the covering radius of a code and its subcodes

This page was built for publication: On the covering radius of subcodes of a code

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