On the covering radius of subcodes of a code

DOI10.1109/18.104338zbMath0742.94014OpenAlexW2057617645MaRDI QIDQ3987472

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

upper boundcovering radiuschromatic numberbinary linear codesubcode

Mathematics Subject Classification ID

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

Related Items (1)

Intersection of Hamming codes avoiding Hamming subcodes

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