Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR19-090 | 27th June 2019 18:03

Quasilinear time list-decodable codes for space bounded channels

RSS-Feed




Revision #1
Authors: Swastik Kopparty, Ronen Shaltiel, Jad Silbak
Accepted on: 27th June 2019 18:03
Downloads: 50
Keywords: 


Abstract:

We consider codes for space bounded channels. This is a model for communication under noise that was studied by Guruswami and Smith (J. ACM 2016) and lies between the Shannon (random) and Hamming (adversarial) models. In this model, a channel is a space bounded procedure that reads the codeword in one pass, and modifies at most a $p$ fraction of the bits of the codeword.

Guruswami and Smith, and later work by Shaltiel and Silbak (RANDOM 2016), gave constructions of list-decodable codes with rate approaching $1-H(p)$ against channels with space $s=c \log n$, with encoding/decoding time $\poly(2^s)=\poly(n^c)$.

In this paper we show that for every constant $0 \le p 0$, there are codes with rate $R \ge 1-H(p)-\epsilon$, list size $\poly(1/\epsilon)$, and furthermore:
\begin{itemize}
\item Our codes can handle channels with space $s=n^{\Omega(1)}$, which is much larger than $O(\log n)$ achieved by previous work.
\item We give encoding and decoding algorithms that run in time $n \cdot \polylog(n)$. Previous work achieved large and unspecified $\poly(n)$ time (even for space $s=1 \cdot \log n$ channels).
\item We can handle space bounded channels that read the codeword in any order, whereas previous work considered channels that read the codeword in the standard order.
\end{itemize}
Our construction builds on the machinery of Guruswami and Smith (with some key modifications) replacing some nonconstructive codes and pseudorandom objects (that are found in exponential time by brute force) with efficient explicit constructions.
For this purpose we exploit recent results of Haramaty, Lee and Viola (SICOMP 2018) on pseudorandom properties of ``$t$-wise independence + low weight noise'' which we quantitatively improve using techniques by Forbes and Kelly (FOCS 2018).

To make use of such distributions, we give new explicit constructions of binary linear codes that have dual distance of $n^{\Omega(1)}$, and are also polynomial time list-decodable from relative distance $\half-\epsilon$, with list size $\poly(1/\epsilon)$. To the best of our knowledge, no such construction was previously known.

Somewhat surprisingly, we show that Reed-Solomon codes with dimension $k<\sqrt{n}$, have this property if interpreted as binary codes (in some specific interpretation) which we term: ``Raw Reed-Solomon Codes''. A key idea is viewing Reed-Solomon codes as ``bundles'' of certain dual-BCH codewords.



Changes to previous version:

Added the list of authors... It seems that in the initial eccc submission I "forgot" to list the other authors...


Paper:

TR19-090 | 27th June 2019 14:32

Quasilinear time list-decodable codes for space bounded channels


Abstract:

We consider codes for space bounded channels. This is a model for communication under noise that was studied by Guruswami and Smith (J. ACM 2016) and lies between the Shannon (random) and Hamming (adversarial) models. In this model, a channel is a space bounded procedure that reads the codeword in one pass, and modifies at most a $p$ fraction of the bits of the codeword.

Guruswami and Smith, and later work by Shaltiel and Silbak (RANDOM 2016), gave constructions of list-decodable codes with rate approaching $1-H(p)$ against channels with space $s=c \log n$, with encoding/decoding time $\poly(2^s)=\poly(n^c)$.

In this paper we show that for every constant $0 \le p 0$, there are codes with rate $R \ge 1-H(p)-\epsilon$, list size $\poly(1/\epsilon)$, and furthermore:
\begin{itemize}
\item Our codes can handle channels with space $s=n^{\Omega(1)}$, which is much larger than $O(\log n)$ achieved by previous work.
\item We give encoding and decoding algorithms that run in time $n \cdot \polylog(n)$. Previous work achieved large and unspecified $\poly(n)$ time (even for space $s=1 \cdot \log n$ channels).
\item We can handle space bounded channels that read the codeword in any order, whereas previous work considered channels that read the codeword in the standard order.
\end{itemize}
Our construction builds on the machinery of Guruswami and Smith (with some key modifications) replacing some nonconstructive codes and pseudorandom objects (that are found in exponential time by brute force) with efficient explicit constructions.
For this purpose we exploit recent results of Haramaty, Lee and Viola (SICOMP 2018) on pseudorandom properties of ``$t$-wise independence + low weight noise'' which we quantitatively improve using techniques by Forbes and Kelly (FOCS 2018).

To make use of such distributions, we give new explicit constructions of binary linear codes that have dual distance of $n^{\Omega(1)}$, and are also polynomial time list-decodable from relative distance $\half-\epsilon$, with list size $\poly(1/\epsilon)$. To the best of our knowledge, no such construction was previously known.

Somewhat surprisingly, we show that Reed-Solomon codes with dimension $k<\sqrt{n}$, have this property if interpreted as binary codes (in some specific interpretation) which we term: ``Raw Reed-Solomon Codes''. A key idea is viewing Reed-Solomon codes as ``bundles'' of certain dual-BCH codewords.



ISSN 1433-8092 | Imprint