Cover Image

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brakensiek, Joshua, Chen, Yeyuan, Dhar, Manik, Zhang, Zihan
Format:	Preprint
Published:	2025
Subjects:	Information Theory Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
by: Ashvinkumar, Vikrant, et al.
Published: (2025)

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
by: Peikert, Chris, et al.
Published: (2025)

Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets
by: Con, Roni, et al.
Published: (2024)

Continuous Optimization for Decoding Errors
by: Srivastava, Shashank
Published: (2024)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids
by: Brakensiek, Joshua, et al.
Published: (2025)

Unbounded Error Correcting Codes
by: Efremenko, Klim, et al.
Published: (2024)

List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Improved Decoding of Tanner Codes
by: Zhou, Zhaienhe, et al.
Published: (2025)

Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
by: Brakensiek, Joshua, et al.
Published: (2025)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025)

Capacity-Achieving Gray Codes
by: Guruswami, Venkatesan, et al.
Published: (2024)

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding
by: Guruswami, Venkatesan, et al.
Published: (2023)

Old and New Results on Alphabetic Codes
by: Bruno, Roberto, et al.
Published: (2025)

Improved Approximation Algorithms for Index Coding
by: Chawin, Dror, et al.
Published: (2024)

List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
by: Srivastava, Shashank, et al.
Published: (2025)

Kernels for Storage Capacity and Dual Index Coding
by: Haviv, Ishay
Published: (2025)

Robust Gray Codes Approaching the Optimal Rate
by: Con, Roni, et al.
Published: (2024)

Optimal Testing of Reed-Muller Codes with an Online Adversary
by: Kelman, Esty, et al.
Published: (2026)

Investigations on Algorithm Selection for Interval-Based Coding Methods
by: Strutz, Tilo, et al.
Published: (2024)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
by: Bruno, Roberto, et al.
Published: (2024)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
by: Chen, Yeyuan, et al.
Published: (2024)

An Additive Approximation Scheme for Generating Dyadic Codings for the Outputs of an LLM
by: Bar-Lev, Daniella, et al.
Published: (2026)

Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications
by: Bruno, Roberto, et al.
Published: (2025)

Undirected Multicast Network Coding Gaps via Locally Decodable Codes
by: Braverman, Mark, et al.
Published: (2025)

Improved Explicit Near-Optimal Codes in the High-Noise Regimes
by: Li, Xin, et al.
Published: (2024)

Source Coding with Free Bits and the Multi-Way Number Partitioning Problem
by: Ahmadypour, Niloufar, et al.
Published: (2020)

Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
by: Brakensiek, Joshua, et al.
Published: (2026)

A Framework for Searching in Graphs in the Presence of Errors
by: Dereniowski, Dariusz, et al.
Published: (2018)

On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment
by: Wang, Ziao, et al.
Published: (2022)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
by: Chen, Yeyuan
Published: (2024)

Entropy Coding of Unordered Data Structures
by: Kunze, Julius, et al.
Published: (2024)

Many Hamiltonians Are Sparsifiable
by: Basu, Arpon, et al.
Published: (2026)

Pcodec: Better Compression for Numerical Sequences
by: Loncaric, Martin, et al.
Published: (2025)

Efficient $\varepsilon$-approximate minimum-entropy couplings
by: Compton, Spencer
Published: (2025)

A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data
by: Smart, Bridget, et al.
Published: (2025)

Hyperbolic Sets in Incomplete Tables
by: Bernal, J. J., et al.
Published: (2025)

Semidefinite Programming for the Asymmetric Stochastic Block Model
by: Gaudio, Julia, et al.
Published: (2025)