PAPER / ARXIV:2609.08005

Algorithmic List Decoding of Reed-Solomon Codes up to Capacity

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

Teoria da informação Complexidade computacional · cruzada

RESUMO

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.

NO MESMO MAPA

Papers relacionados

cs.IT16 de set. de 2026

List Decoding, Linear Hashing, and Furstenberg over $\mathbb{F}_q$

Vinayak M. Kumar , Geoffrey Mon

Algorithmic List Decoding of Reed-Solomon Codes up to Capacity

Papers relacionados

List Decoding, Linear Hashing, and Furstenberg over $\mathbb{F}_q$

A Note on Binary Quadratic Systems and their relation to complexity theory

Binary Deletion Channel Capacity to Within One Hundredth of a Bit

Asymptotic Max-Min Fair Allocation with Random Utilities

Polynomial-Time MIMO Detection at the Maximum-Likelihood Threshold

Source Entropy-Guided Adaptive Transmission for Communication-Driven Multi-View Sensing