Multiple packing in sum-type metric spaces

Authors:
Rudolf Ahlswede;Vladimir Blinovsky
Affiliations:
Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, D-33501 Bielefeld, Germany;Fakultät für Mathematik, Universität Bielefeld, Postfach 100131, D-33501 Bielefeld, Germany
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 6
Cited 1

Lower bound for the linear multiple packing of the binary Hamming space

Journal of Combinatorial Theory Series A
Asymptotic Combinatorial Coding Theory

Asymptotic Combinatorial Coding Theory
Information Theory and Reliable Communication

Information Theory and Reliable Communication
Error Probability Exponent of List Decoding at Low Rates

Problems of Information Transmission
List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)

List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)
Error-correcting codes for list decoding

IEEE Transactions on Information Theory

Bibliography of publications by Rudolf Ahlswede

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present the exact solution of the asymptotics of the multiple packing problem in a finite space with a sum-type metric.