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 <inline-formula> <tex-math notation="LaTeX">L </tex-math></inline-formula>. For odd &l...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 62; no. 3; pp. 1119 - 1128
Main Author:	Polyanskiy, Yury
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.03.2016 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Asymptotic methods Asymptotic properties Binary codes Combinatorial coding theory converse bounds Decoding Estimates Indexes Information theory Linear programming list-decoding Programming Slopes Thresholds Upper bound Upper bounds Combinatorial coding theory list-decoding converse bounds
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!