It'll Probably Work Out

From MaRDI portal
Publication:2989042

DOI10.1145/2688073.2688092zbMATH Open1364.94727arXiv1408.2237OpenAlexW2025942520MaRDI QIDQ2989042FDOQ2989042

Atri Rudra, Mary Wootters

Publication date: 19 May 2017

Published in: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Abstract: In this work, we introduce a framework to study the effect of random operations on the combinatorial list-decodability of a code. The operations we consider correspond to row and column operations on the matrix obtained from the code by stacking the codewords together as columns. This captures many natural transformations on codes, such as puncturing, folding, and taking subcodes; we show that many such operations can improve the list-decoding properties of a code. There are two main points to this. First, our goal is to advance our (combinatorial) understanding of list-decodability, by understanding what structure (or lack thereof) is necessary to obtain it. Second, we use our more general results to obtain a few interesting corollaries for list decoding: (1) We show the existence of binary codes that are combinatorially list-decodable from 1/2epsilon fraction of errors with optimal rate Omega(epsilon2) that can be encoded in linear time. (2) We show that any code with Omega(1) relative distance, when randomly folded, is combinatorially list-decodable 1epsilon fraction of errors with high probability. This formalizes the intuition for why the folding operation has been successful in obtaining codes with optimal list decoding parameters; previously, all arguments used algebraic methods and worked only with specific codes. (3) We show that any code which is list-decodable with suboptimal list sizes has many subcodes which have near-optimal list sizes, while retaining the error correcting capabilities of the original code. This generalizes recent results where subspace evasive sets have been used to reduce list sizes of codes that achieve list decoding capacity.


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






Cited In (3)






This page was built for publication: It'll Probably Work Out

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