Upper bound on list-decoding radius of binary codes

Consider the problem of packing Hamming balls of a given relative radius subject to the constraint that they cover any point of the ambient Hamming space with multiplicity at most L. For odd L ≥ 3 an asymptotic upper bound on the rate of any such packing is proven. The resulting bound improves the b...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings / IEEE International Symposium on Information Theory pp. 2231 - 2235
Main Author:	Polyanskiy, Yury
Format:	Conference Proceeding Journal Article
Language:	English
Published:	IEEE 01.06.2015
Subjects:	Asymptotic properties Binary codes Combinatorial coding theory converse bounds Decoding Estimates Information theory Joints list-decoding Polynomials Programming Slopes Thresholds Tin Upper bound Upper bounds
ISSN:	2157-8095, 2157-8117
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!