List-Decodable Zero-Rate Codes

DOI10.1109/TIT.2018.2868957MaRDI QIDQ4629924zbMATH OpenOpenAlexFDO

Authors Noga Alon, Boris Bukh, Yury Polyanskiy

Publication date 28 March 2019

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

Full work available at URL https://arxiv.org/abs/1710.10663

Mathematics Subject Classification ID

Decoding (94B35)

Abstract: We consider list-decoding in the zero-rate regime for two cases: the binary alphabet and the spherical codes in Euclidean space. Specifically, we study the maximal $auin[0,1]$ for which there exists an arrangement of $M$ balls of relative Hamming radius $au$ in the binary hypercube (of arbitrary dimension) with the property that no point of the latter is covered by $L$ or more of them. As $Moinfty$ the maximal $au$ decreases to a well-known critical value $a{u}_L$. In this work, we prove several results on the rate of this convergence. For the binary case, we show that the rate is $Theta(M^{-1})$ when $L$ is even, thus extending the classical results of Plotkin and Levenshtein for $L=2$. For $L=3$ the rate is shown to be $Theta(M^{-frac23})$. For the similar question about spherical codes, we prove the rate is $Omega(M^{-1})$ and $O(M^{-frac2L{L}^2-L+2})$.

Cited in

(2)

• Coding in a Z-channel in case of many errors
• Lovász, vectors, graphs and codes

This page was built for publication: List-Decodable Zero-Rate Codes

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