Improved lower bounds for multicovering codes

DOI10.1109/18.796398zbMATH Open0960.94041OpenAlexW2123912649MaRDI QIDQ4503441FDOQ4503441

Authors: Andrew Klapper 

Publication date: 7 September 2000

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

Full work available at URL: https://semanticscholar.org/paper/da8ab495deeda1c0ebfbabeb0d7b49555374c81a

Recommendations

• The multicovering radii of codes
• Multicovering bounds from relative covering radii
• Multicovering bounds from linear inequalities
• Improved Multicovering Bounds From Linear Inequalities and Supercodes
• scientific article; zbMATH DE number 2109039

zbMATH Keywords

lower boundserror-correcting codesmulticovering radius\(m\)-covering radius

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 (9)

• Improving Error Bounds for Multipole-Based Treecodes
• The multicovering radius problem for some types of discrete structures
• Title not available (Why is that?)
• Improved bounds for the rate loss of multiresolution source codes
• An improvement of the Van Wee bound for binary linear covering codes
• Improved upper bounds on sizes of codes
• Improved Multicovering Bounds From Linear Inequalities and Supercodes
• Modified bounds for covering codes
• Multicovering bounds from linear inequalities

This page was built for publication: Improved lower bounds for multicovering codes

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