Imagen de Portada

List Recovery for Random Low-Rate Linear Codes

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hair, Isaac M, Sahai, Amit
Formato:	Preprint
Publicado:	2026
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

List-Recovery of Random Linear Codes over Small Fields
por: Doron, Dean, et al.
Publicado: (2025)

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

Characterization of Blind Code Rate Recovery in Linear Block Codes
por: Vedantam, Atreya, et al.
Publicado: (2026)

On the List-Decodability of Random (Linear) Sum-Rank Metric Codes
por: Liu, Yang, et al.
Publicado: (2025)

Public Key Encryption from High-Corruption Constraint Satisfaction Problems
por: Hair, Isaac M, et al.
Publicado: (2026)

Deterministic Hardness of Approximation For SVP in all Finite $\ell_p$ Norms
por: Hair, Isaac M, et al.
Publicado: (2026)

SVP$_p$ is Deterministically NP-Hard for all $p > 2$, Even to Approximate Within a Factor of $2^{\log^{1-\varepsilon} n}$
por: Hair, Isaac M., et al.
Publicado: (2025)

Linear List Decodable Edit-Correcting Codes with Rate Approaching $1$
por: Li, Yuting, et al.
Publicado: (2025)

Fly-PRAC: Packet Recovery for Random Linear Network Coding
por: Nazari, Hosein K., et al.
Publicado: (2026)

Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent
por: Levi, Matan, et al.
Publicado: (2024)

Punctured Low-Bias Codes Behave Like Random Linear Codes
por: Guruswami, Venkatesan, et al.
Publicado: (2021)

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

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

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

Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes
por: Goyal, Rohan, et al.
Publicado: (2025)

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

Improved Logical Error Rate via List Decoding of Quantum Polar Codes
por: Gong, Anqi, et al.
Publicado: (2023)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
por: Guo, Zeyu, et al.
Publicado: (2024)

On the Analysis of Random Linear Streaming Codes in Stochastic Channels
por: Huang, Kai, et al.
Publicado: (2025)

Decoding Insertions/Deletions via List Recovery
por: Banerjee, Anisha, et al.
Publicado: (2025)

Weak Superimposed Codes of Improved Asymptotic Rate and Their Randomized Construction
por: Tsunoda, Yu, et al.
Publicado: (2024)

Balanced Low-Complexity and Flexible Error-Correction List Flip Decoding for Polar Codes
por: Lv, Yansong, et al.
Publicado: (2023)

Recovery Algorithms for Linear Batch Codes
por: Düzgün, Baran, et al.
Publicado: (2026)

Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size
por: Ron-Zewi, Noga, et al.
Publicado: (2024)

Weight Structure of Low/High-Rate Polar Codes and Its Applications
por: Rowshan, Mohammad, et al.
Publicado: (2024)

On the Stochastic Analysis of Random Linear Streaming Codes in Multi-Hop Relay Networks
por: Huang, Kai, et al.
Publicado: (2025)

Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure
por: Lin, Mao-Chao, et al.
Publicado: (2025)

A Syndrome-Space Approach to Proximity Gaps and Correlated Agreement for Random Linear Codes
por: Yuan, Chen, et al.
Publicado: (2026)

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

List Decoding and New Bicycle Code Constructions for Quantum LDPC Codes
por: Rabeti, Sheida, et al.
Publicado: (2025)

Sparse Signal Recovery from Random Measurements
por: Wong, Man Ting, et al.
Publicado: (2026)

Explicit List-Decodable Linearized Reed-Solomon and Folded Linearized Reed-Solomon Subcodes
por: Shang, Kuo, et al.
Publicado: (2026)

Action-List Reinforcement Learning Syndrome Decoding for Binary Linear Block Codes
por: Taghipour, Milad, et al.
Publicado: (2025)

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

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

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)

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
por: Berman, Amit, et al.
Publicado: (2026)