Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)

DOI10.1109/TIT.1986.1057249MaRDI QIDQ3752296zbMATH OpenFDO

Authors Philippe Delsarte, Ph. Piret

Publication date 1986

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• On the covering radius of binary, linear codes meeting the Griesmer bound
• Lower bound of covering radius of binary irreducible Goppa codes
• Bounds on the covering radius of linear codes
• Lower Bounds on the Covering Radius of the Non-Binary and Binary Irreducible Goppa Codes
• Some new upper bounds on the covering radius of binary linear codes
• Asymptotic bounds on the covering radius of binary codes
• On covering radius lower bound for a class of binary codes
• On the covering radius of binary codes (Corresp.)
• scientific article; zbMATH DE number 1522570
• Lower bound of the covering radius of irreducible Goppa codes

Cited in

(3)

• On identifying codes in binary Hamming spaces
• New bounds on binary identifying codes
• Dimension 1 sequences are close to randoms

This page was built for publication: Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)

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