Imagen de Portada

Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ron-Zewi, Noga, Venkitesh, S., Wootters, Mary
Formato:	Preprint
Publicado:	2024
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Advances in List Decoding of Polynomial Codes
por: Kumar, Mrinal, et al.
Publicado: (2026)

LDPC Codes Achieve List Decoding Capacity
por: Mosheiff, Jonathan, et al.
Publicado: (2019)

Random Reed-Solomon Codes are List Recoverable with Optimal List Size
por: Doron, Dean, et al.
Publicado: (2024)

A Note on the Equivalence Between Zero-knowledge and Quantum CSS Codes
por: Ron-Zewi, Noga, et al.
Publicado: (2026)

Efficient Decoding of Double-circulant and Wozencraft Codes from Square-root Errors
por: Dubin, Oren, et al.
Publicado: (2025)

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)
por: Resch, Nicolas, et al.
Publicado: (2025)

Polynomials, Divided Differences, and Codes
por: Venkitesh, S.
Publicado: (2024)

List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
por: Pernice, Francisco, et al.
Publicado: (2024)

On Worst-Case Optimal Polynomial Intersection
por: Sun, Yihang, et al.
Publicado: (2026)

Improved Construction of Robust Gray Code
por: Fathollahi, Dorsa, et al.
Publicado: (2024)

List decoding of repeated codes
por: Hernando, Fernando, et al.
Publicado: (2012)

List decoding of evaluation codes
por: Brazitikos, Silouanos, et al.
Publicado: (2025)

Generic Reed-Solomon Codes Achieve List-decoding Capacity
por: Brakensiek, Joshua, et al.
Publicado: (2022)

Bounds for list-decoding and list-recovery of random linear codes
por: Guruswami, Venkatesan, et al.
Publicado: (2020)

AG Codes Achieve List-decoding Capacity over Constant-sized Fields
por: Brakensiek, Joshua, et al.
Publicado: (2023)

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

Improved Trade-offs Between Amortization and Download Bandwidth for Linear HSS
por: Blackwell, Keller, et al.
Publicado: (2024)

Limitations to Computing Quadratic Functions on Reed-Solomon Encoded Data
por: Blackwell, Keller, et al.
Publicado: (2025)

Interactive Coding with Small Memory and Improved Rate
por: Fathollahi, Dorsa, et al.
Publicado: (2024)

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
por: Doron, Dean, et al.
Publicado: (2024)

Improved List Size for Folded Reed-Solomon Codes
por: Srivastava, Shashank
Publicado: (2024)

Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
por: Con, Roni, et al.
Publicado: (2024)

Near-Optimal List-Recovery of Linear Code Families
por: Li, Ray, et al.
Publicado: (2025)

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

Improved Bounds on Access-Redundancy Tradeoffs in Quantized Linear Computations
por: Li, Ching-Fang, et al.
Publicado: (2025)

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
por: Mosheiff, Jonathan, et al.
Publicado: (2024)

Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes
por: Komech, Sergey, et al.
Publicado: (2025)

Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)
por: Ron-Zewi, Noga, et al.
Publicado: (2024)

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
por: Berman, Amit, et al.
Publicado: (2024)

List-Decodable Folded Quantum Hermitian Codes
por: Matthews, Gretchen L., et al.
Publicado: (2026)

List Reconstruction Problem with List Size Two
por: Vu, Binh, et al.
Publicado: (2026)

List Decodable Quantum LDPC Codes
por: Bergamaschi, Thiago, et al.
Publicado: (2024)

Faster List Decoding of AG Codes
por: Beelen, Peter, et al.
Publicado: (2023)

Simplified Successive Cancellation List Decoding of PAC Codes
por: Saber, Hamid, et al.
Publicado: (2024)

Reverse PAC Codes: Look-ahead List Decoding
por: Gu, Xinyi, et al.
Publicado: (2024)

List-based Optimization of Proximal Decoding for LDPC Codes
por: Tsouchlos, Andreas, et al.
Publicado: (2024)

List Decoding Bounds for Binary Codes with Noiseless Feedback
por: Gupta, Meghal, et al.
Publicado: (2024)

Finite Alphabet Fast List Decoders for Polar Codes
por: Shah, Syed Aizaz Ali, et al.
Publicado: (2024)

PAC Codes: Sequential Decoding vs List Decoding
por: Rowshan, Mohammad, et al.
Publicado: (2020)

List Recovery for Random Low-Rate Linear Codes
por: Hair, Isaac M, et al.
Publicado: (2026)