On the packing radius and the covering radius of equal-weight codes

DOI10.1016/S0012-365X(99)00166-1zbMATH Open0991.94063OpenAlexW2161110435MaRDI QIDQ1970698FDOQ1970698

Stephen D. Cohen, N. N. Kuzyurin

Publication date: 19 November 2001

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00166-1

zbMATH Keywords

complexitylower boundsupper boundcovering radiuspacking radiusconstructivityequal-weight code

Mathematics Subject Classification ID

Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• The packing radius of a poset block code

   Recommendations

• On relations between covering radius and dual distance 👍 👎
• On the covering radius of codes 👍 👎
• Weighted coverings and packings 👍 👎
• Packing radius, covering radius, and dual distance 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: On the packing radius and the covering radius of equal-weight codes

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