List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)

2025-10-08

AI Summary

This paper addresses a fundamental problem in list recoverable codes: bounding the maximum number of codewords highly consistent with given bounded-size input lists (soft information). Using combinatorial analysis, probabilistic methods, and algebraic constructions—augmented by tools from information theory and computational complexity—the work systematically establishes existence thresholds, structural classifications, and feasibility boundaries for such codes. It introduces the first unified framework subsuming both unique decoding and list decoding, revealing their common theoretical foundation as a general paradigm for soft-information processing. Beyond cascade-code list decoding, the framework enables novel applications including local decodability and pseudorandomness construction. Optimality is rigorously verified for multiple explicit constructions—including Reed–Solomon and folded Reed–Solomon codes—and several key open problems are identified, fostering deeper interplay between coding theory and theoretical computer science.

Technology Category

• Constraint Satisfaction and Optimization: Other Foundations of Constraint Satisfaction
• Machine Learning: Probabilistic Circuits and Graphical Models
• Reasoning under Uncertainty: Stochastic Optimization

Application Category

• Security and Privacy: Applications of cryptography
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

List recovery is a fundamental task for error-correcting codes, vastly generalizing unique decoding from worst-case errors and list decoding. Briefly, one is given ''soft information'' in the form of input lists S_1,...,S_n of bounded size, and one argues that there are not too many codewords that agree a lot with this soft information. This general problem appears in many guises, both within coding theory and in theoretical computer science more broadly. In this article we survey recent results on list recovery codes, introducing both the ''good'' (i.e., possibility results, showing that codes with certain list recoverability exist), the ''bad'' (impossibility results), and the ''unknown''. We additionally demonstrate that, while list recoverable codes were initially introduced as a component in list decoding concatenated codes, they have since found myriad applications to and connections with other topics in theoretical computer science.

Problem

• List recovery generalizes unique and list decoding
• It studies codes handling bounded-size input lists
• Survey covers existence, impossibility, and open problems

Innovation

• List recovery codes generalize unique decoding
• Survey covers possibility and impossibility results
• Applications extend beyond coding theory to computer science