Covering machines

DOI10.1016/0012-365X(92)90536-OzbMath0754.94006OpenAlexW2912482274MaRDI QIDQ1199588

Robert Calderbank

Publication date: 16 January 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90536-o

zbMATH Keywords

binary linear codescovering properties

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25)

Related Items (1)

Long binary narrow-sense BCH codes are normal

Cites Work

• Covering bounds for codes
• On the covering radius of codes
• The minimal covering radius t(15,6) of a six-dimensional binary linear code of length 15 is equal to 4
• The normalized second moment of the binary lattice determined by a convolutional code
• Bounds for abnormal binary codes with covering radius one

This page was built for publication: Covering machines