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

DOI10.1109/TIT.1986.1057249zbMath0611.94010MaRDI QIDQ3752296

Ph. Piret, Philippe Delsarte

Publication date: 1986

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (3)

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

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