---
title: Locally List-Decodable Codes
url: https://www.emergentmind.com/topics/locally-list-decodable-codes
type: topic
---

# Locally List-Decodable Codes

A locally list decodable code (LLDC) is an error-correcting code equipped with an efficient randomized algorithm that, given oracle access to a received word corrupted in a fraction of coordinates, can specify for any given message coordinate a short list of possible values such that for every codeword close to the received word, there is a decoder in the list that outputs the correct symbol at almost all positions. This property is a local, sublinear-time analog of classical list decoding, central to both complexity theory (hardness amplification, pseudorandom generator constructions) and to high-efficiency data transmission in the presence of large corruption rates. Locally list decodable codes generalize locally decodable codes (LDCs) and locally correctable codes (LCCs) to the strong adversarial regime.

## 1. Formal Definitions and Problem Statement

Let $C: \Sigma^k \rightarrow \Sigma^n$ denote a block code over alphabet $\Sigma$, with rate $R = k/n$ and minimum relative distance $\delta$. A code is $(Q, \alpha, L)$–locally list-decodable if for any received word $w \in \Sigma^n$ agreeing with some codeword $C(x)$ on at least $1-\alpha$ fraction of coordinates, there exists a (random) map producing $L$ local algorithms $A_1, \ldots, A_L$ such that for every message position $i$ and for some $j \in [L]$, $A_j$ recovers $x_i$ with probability at least $2/3$ using at most $Q$ queries to $w$ [1706.03383]. In the more general setting of locally list-recoverable codes, the input is a word of lists $(S_1, ..., S_n)$, each $S_i \subseteq \Sigma$, $|S_i| \leq \ell$, and the decoder recovers message symbols indexed by $i$ if there exists a codeword $C(x)$ such that $C(x)_i \in S_i$ except at an $\alpha$ fraction of coordinates.

Approximate LLDCs (aLLDCs) permit recovery of $x_i$ on a $1-\delta$ fraction of $i$, for some fixed $\delta<1$ [2601.22535]. The critical trade-off parameters are code rate as a function of error-tolerance $\alpha$ (ideally approaching information-theoretic capacity), query complexity $Q$ (preferably polylogarithmic or sublinear in $n$), list size $L$, and efficiency (decoding time and circuit depth).

## 2. Core Construction Paradigms

Multiple paradigms underpin the construction of LLDCs, each exploiting a distinct combinatorial, algebraic, or high-dimensional expansion property.

### Tensor Power and Composition

The tensor power construction applies to a high-rate globally list-recoverable code $C$ over $\Sigma$ to produce $C^{\otimes t}$: $\Sigma^{k^t} \to \Sigma^{n^t}$ by applying $C$ on each axis. For $t$ fixed, $C^{\otimes t}$ is globally list-recoverable with rate, distance, and error tolerance inherited as tensor powers. Approximate locality is achieved by querying random low-dimensional slices; pre-encoding with a high-rate locally decodable code (LDC) corrects remaining local errors, yielding truly local list-decoding [1706.03383]. The ultimate code is $C_{\text{final}} = C^{\otimes t} \circ \text{LDC}$, with query $Q = Q_{\text{LDC}} n^{1-1/t}$ and rate $1-\epsilon$.

### High-Dimensional Expander Codes

Recent advances exploit high-dimensional expanders (HDXs), especially coset complexes, to build direct-product codes where vertices correspond to group cosets and codewords are local restrictions consistent on overlapping neighborhoods. Polylog-round belief propagation, combined with explicit low-congestion routing on the HDX, supports local list-decoding in polylogarithmic time, achieving constant rate and error tolerance approaching the information-theoretic bound [2601.22535]. This framework provides both polylog-rate (with parameters scaling as $\ell=O(1/\epsilon^2)$, $Q = \mathrm{poly}(1/\epsilon)\cdot\mathrm{polylog}(n)$) and constant-rate codes (rate $\exp(-O(1/\epsilon^3))$, $Q = \mathrm{polylog}(n)\exp(O(1/\epsilon^3))$).

### Affine-Invariant and Algebraic Geometric Codes

Affine-invariant families such as lifted Reed-Solomon codes admit local list-decoding by leveraging algebraic closure under affine maps and polynomial structure. Given the projection of multivariate codeword polynomials onto univariate polynomials over field extensions, algorithms can perform line-and-plane-based local list-decoding, with error radius matching the Johnson bound and sublinear query complexity, at rates near $1-\delta$ [1412.0305].

### Locally Repairable and Homomorphism Codes

Locally repairable codes (LRCs) and homomorphism codes support list-decoding via their local structure. For example, for $(n,k,r,\delta)$–LRCs, combining local list-decoding on disjoint partitions with global reconciliation exceeds the Johnson bound for many parameter choices [1801.04229]. In the context of group homomorphism codes, certificate-based and combinatorial preprocessing techniques allow for local list-decoding even up to minimum distance for abelian or alternating group domains, at list size $\mathrm{poly}(1/\epsilon)$ and polylogarithmic query [1806.02969].

## 3. Main Theorems and Parameter Regimes

Key formal results on the existence and constructions of LLDCs include:

| Construction Paradigm         | Rate                 | Query Complexity     | List Size   | Alphabet Size             | Error Tolerance          | Reference         |
|------------------------------|----------------------|---------------------|-------------|---------------------------|--------------------------|-------------------|
| Tensor+LDC (exp/const alpha) | $1-\epsilon$         | $n^{1/t+o(1)}$      | $\exp\exp\exp(O(\log^* n))$ | $\mathrm{GF}(2^s),\, s\to O(t/\epsilon\log \ell)$ | $\Omega(1)$                | [1706.03383]      |
| HDX/coset complex            | $\exp(-O(1/\epsilon^3))$ | $\mathrm{polylog}(n)\exp(O(1/\epsilon^3))$ | $O(1/\epsilon^2)$ | Binary                    | Approaches $1-H_2(\epsilon)$ | [2601.22535]      |
| Lifted Reed-Solomon          | $1-\delta$ as $q\to\infty$ | $O(q^3)$            | $\mathrm{poly}(1/\epsilon)$ | $F_q$                     | Up to $1-\sqrt{1-\delta}-\epsilon$ | [1412.0305]      |
| LRC (Tamo–Barg construction) | Singleton-optimal    | $\mathrm{poly}(n)$  | $O(\mathrm{poly}(n))$   | $F_q$, $q$ large                   | Exceeds Johnson bound        | [1801.04229]      |
| Homomorphism codes           | $\geq$ Hadamard rate | Polylog$\,|G|$      | $\mathrm{poly}(1/\epsilon)$ | (group-dependent)         | Up to mindist$-\epsilon$      | [1806.02969]      |

These results delineate known explicit and non-explicit codes matching or closely approaching the information-theoretic limits on rate versus error fraction for LLDCs, often within constant or polylog factors in query and list size.

## 4. Local List-Decoding Algorithms and Analysis

Standard LLDC frameworks rely on randomized sublinear sampling coupled with local consistency checks and iterative message-passing or belief propagation to resolve ambiguity. For tensor codes, random slicing and candidate propagation along tensor axes yields approximate list-recovery, which is then boosted via LDC composition [1706.03383]. On HDXs, polylog-round local sampling and explicit routing maintain candidate lists at each vertex, pruning by intersection and small-set samplers. Pruning and candidate list management ensure error does not accumulate multiplicatively across rounds; instead, it is controlled additively via local expansion and negative correlation arguments, achieving overall agreement for the correct codeword in at least one candidate decoder [2601.22535].

In affine-invariant codes, the “line-and-plane” stitching algorithm reconstructs codeword values at a target index by repeated univariate and bivariate list-decodes on random lines and planes, exploiting the low-degree structure under field isomorphisms [1412.0305]. For group codes, majority-vote sampling, subgroup decomposition, and combinatorial bucketing are employed to isolate candidate homomorphisms with high agreement with the received word [1806.02969].

## 5. Information-Theoretic Barriers and Open Problems

LLDCs, and their approximate variants, are subject to several lower bounds. Any $(\epsilon, \ell, q)$-locally list-decodable code must satisfy $q \cdot (\log \ell + \log(1/R)) \geq \Omega(\log N / \epsilon)$ [2601.22535]. The standard rate–error trade-off is $R \leq 1-H_q(\epsilon) + o(1)$, where $H_q$ is the $q$-ary entropy; most capacity-achieving constructions approach $R \to 1-H_q(\epsilon)$ only with rapidly growing alphabet size or unbounded list size.

Key open problems include eliminating the super-constant list-size growth in explicit tensor-LDC approaches, reducing query complexity to polylogarithmic in $n$ and $1/\epsilon$, strengthening local correction to codeword symbols (not just message symbols), and achieving expander-based locality without derandomization or heavy precomputation [1706.03383].


## 6. Applications and Relation to Complexity Theory

LLDCs are central to several applications in probabilistically checkable proofs (PCPs), hardness amplification, pseudorandom generator design, and high-throughput distributed storage. The existence of high-rate, low-locality LLDCs enables capacity-achieving local coding in feasible parallel time (e.g., RNC$^1$ circuits), optimal randomness-efficient PRGs under mild assumptions, and sub-polynomial-time distance and list-amplification [2601.22535]. For instance, composition with good LDCs yields near-optimal parallel list-decodable codes, resolving a suite of classical open questions in coding and complexity theory. In practice, these methods yield efficient coding schemes for distributed storage with strong locality and worst-case resilience, as well as foundational primitives for average-case complexity and cryptographic constructions.

## 7. Connections, Generalizations, and Future Directions

LLDCs connect to broad areas of combinatorics, group theory, spectral expanders, and algebraic geometry. High-dimensional expander techniques have expanded the scope of list-decodable local codes from algebraic families to combinatorial ones, revealing new trade-offs in locality, rate, and error-tolerance. Affine-invariant and homomorphism-based codes broaden the universality of list-decoding up to the minimum distance, especially for group-theoretic structures. 

Research directions include direct derandomized tensorization of high-rate list-recoverable codes, extending local list-decoding to more general algebraic or combinatorial frameworks, and systematic study of certificate list-decoding and domain relaxation in non-solvable groups [1806.02969]. The universality of sublinear-time and parallel algorithms for LLDCs continues to be an area of active development, as does the explicit construction of capacity-achieving codes with optimal locality and efficient parallel decoding.

Source: https://www.emergentmind.com/topics/locally-list-decodable-codes