Multiple packing in sum-type metric spaces

DOI10.1016/j.dam.2007.07.012zbMath1144.05016OpenAlexW2073371997MaRDI QIDQ947090

Vladimir Blinovsky

Publication date: 29 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.07.012

zbMATH Keywords

packing

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds for codes in the case of list decoding of finite volume
• Lower bound for the linear multiple packing of the binary Hamming space
• List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
• Error probability exponent of list decoding at low rates
• A strange pigeon-hole principle
• Code bounds for multiple packings over a nonbinary finite alphabet
• Error-correcting codes for list decoding

This page was built for publication: Multiple packing in sum-type metric spaces