Sharp threshold rates for random codes

DOI10.1109/TIT.2021.3123497arXiv2009.04553MaRDI QIDQ6348784FDOQ6348784

Jonathan Moshieff, Shashwat Silas, Mary Wootters, Venkatesan Guruswami, Nicolas Resch

Publication date: 9 September 2020

Abstract: Suppose that $mathcalP$ is a property that may be satisfied by a random code $CsubsetSigm{a}^n$. For example, for some $pin(0,1)$, $mathcalP$ might be the property that there exist three elements of $C$ that lie in some Hamming ball of radius $pn$. We say that $R^{*}$ is the threshold rate for $mathcalP$ if a random code of rate $R^{*}+varepsilon$ is very likely to satisfy $mathcalP$, while a random code of rate $R^{*}-varepsilon$ is very unlikely to satisfy $mathcalP$. While random codes are well-studied in coding theory, even the threshold rates for relatively simple properties like the one above are not well understood. We characterize threshold rates for a rich class of properties. These properties, like the example above, are defined by the inclusion of specific sets of codewords which are also suitably "symmetric." For properties in this class, we show that the threshold rate is in fact equal to the lower bound that a simple first-moment calculation obtains. Our techniques not only pin down the threshold rate for the property $mathcalP$ above, they give sharp bounds on the threshold rate for list-recovery in several parameter regimes, as well as an efficient algorithm for estimating the threshold rates for list-recovery in general.

Mathematics Subject Classification ID

Other types of codes (94B60)

This page was built for publication: Sharp threshold rates for random codes

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