Algorithmic List Decoding of Reed-Solomon Codes up to Capacity

Joshua Brakensiek; Yeyuan Chen; Aaron Putterman; Zihan Zhang; Kai Zhe Zheng

Home/Archive/arXiv

arXiv · 2609.08005

Algorithmic List Decoding of Reed-Solomon Codes up to Capacity

Joshua Brakensiek·Yeyuan Chen·Aaron Putterman·Zihan Zhang·Kai Zhe Zheng

View original source ↗Read source document ↗Export metadata ↓

Abstract

We give a deterministic polynomial-time list-decoding algorithm for Reed-Solomon codes over prime fields that approaches list-decoding capacity for every evaluation set and every constant rate.

Explore related subjects

cs.IT cs.CC math.IT

Keep this discovery

BibTeX RIS

Joshua Brakensiek, Yeyuan Chen, Aaron Putterman, Zihan Zhang, Kai Zhe Zheng. 2026-09-07. Algorithmic List Decoding of Reed-Solomon Codes up to Capacity. https://arxiv.org/abs/2609.08005

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.CC subject cs.IT subject math.IT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

On the sample complexity of the generalized hidden shift problem over arbitrary finite groups

We formulate the generalized hidden shift problem over arbitrary finite groups and obtain upper and lower bounds for the sample complexity in terms of group theoretic data.

quant-ph↗

arXiv2026

It's Hard to PArcK

We show that Partizan Arc Kayles (PArcK), a generalization of Domineering to graphs, is PSPACE-complete via a reduction from Positive CNF and with recently-discovered techniques for creating PArcK positions with high temperature. The reduction uses only red and blue edges.

cs.CC↗

arXiv2025

Turing complete Navier-Stokes steady states via cosymplectic geometry

In this article, we construct stationary solutions to the Navier-Stokes equations on certain Riemannian $3$-manifolds that exhibit Turing completeness, in the sense that they are capable of performing universal computation. This universality arises on manifolds admitting nonvanishing harmonic 1-forms, thus showing that computational universality is not obstructed by viscosity, provided the underlying geometry satisfies a mild cohomological condition. The proof makes use of a correspondence between nonvanishing harmonic $1$-forms and cosymplectic geometry, which extends the classical correspondence between Beltrami fields and Reeb flows on contact manifolds.

math.DG↗