Coding for Communications
C.5.2
Lecture
List Decoding

# Linear-Time Erasure List-Decoding of Expander Codes

Noga Ron-Zewi, Mary Wootters, Gilles Zemor

## Date & Time

01:00 am – 01:00 am

## Abstract

We give a linear-time erasure list-decoding algorithm for expander codes. More precisely, let $r > 0$ be any integer. Given a linear inner code $\cC_0$ of length $d$, and a $d$-regular bipartite expander graph $G$ with $n$ vertices on each side, we give an algorithm to list-decode the expander code $\cC = \cC(G, \cC_0)$ of length $nd$ from approximately $\delta \delta_r nd$ erasures in time $n \cdot \poly(d2^r / \delta)$, where $\delta$ and $\delta_r$ are the relative distance and $r$'th generalized relative distance of $\cC_0$, respectively. To the best of our knowledge, this is the first linear-time algorithm that can list-decode expander codes from erasures beyond their (designed) distance of approximately $\delta^2 nd$. To obtain our results, we show that an approach similar to that of (Hemenway, Wootters, Information and Computation, 2018) can be used to obtain such an erasure-list-decoding algorithm with an exponentially worse dependence of the running time on $r$ and $\delta$; then we show how to improve the dependence of the running time on these parameters.

## Presenters

#### Noga Ron-Zewi

University of Haifa

#### Mary Wootters

Stanford University

#### Gilles Zemor

Universite de Bordeaux

Paper

Lund University