The multicovering radii of codes

DOI10.1109/18.605612MaRDI QIDQ4345648zbMATH OpenOpenAlexFDO

Authors Andrew Klapper

Publication date 8 January 1998

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

Full work available at URL https://doi.org/10.1109/18.605612

zbMATH Keywords

block codecovering radiusmulticovering radius

Mathematics Subject Classification ID

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

Recommendations

• Improved lower bounds for multicovering codes
• Multicovering bounds from relative covering radii
• scientific article; zbMATH DE number 2109039
• Improved Multicovering Bounds From Linear Inequalities and Supercodes
• scientific article; zbMATH DE number 1284421

Cited in

(14)

• The multicovering radius problem for some types of discrete structures
• Multi-covering radius for rank metric codes
• The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
• Multicovering bounds from linear inequalities
• scientific article; zbMATH DE number 4016768 (Why is no real title available?)
• Improved Multicovering Bounds From Linear Inequalities and Supercodes
• On the Complexity of Multicovering Radii
• Subcodes and covering radius (Corresp.)
• scientific article; zbMATH DE number 4095515 (Why is no real title available?)
• Improved lower bounds for multicovering codes
• scientific article; zbMATH DE number 2109039 (Why is no real title available?)
• Bounds for the multicovering radii of Reed-Muller codes with applications to stream ciphers
• The third generalized covering radius for binary primitive double-error-correcting BCH codes
• Some optimal codes from algebraic geometry and their covering radii

This page was built for publication: The multicovering radii of codes

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