Cover Image

Near-Optimal List-Recovery of Linear Code Families

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Ray, Shagrithaya, Nikhil
Format:	Preprint
Published:	2025
Subjects:	Information Theory Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)

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

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

The Support Designs of Several Families of Lifted Linear Codes
by: Ding, Cunsheng, et al.
Published: (2024)

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

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

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

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

A Family of Low-Complexity Binary Codes with Constant Hamming Weights
by: Sasidharan, Birenjith, et al.
Published: (2024)

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

Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
by: Alrabiah, Omar, et al.
Published: (2024)

Counterexamples, Constructions, and Nonexistence Results for Optimal Ternary Cyclic Codes
by: Bao, Jingjun, et al.
Published: (2026)

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

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

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
by: Yu, Wenjun, et al.
Published: (2025)

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
by: Liu, Hengfeng, et al.
Published: (2025)

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

Near optimal constructions of frameproof codes
by: Liu, Miao, et al.
Published: (2024)

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

A Survey on Codes from Simplicial Complexes
by: Wu, Yansheng, et al.
Published: (2024)

On H-Intersecting Graph Families and Counting of Homomorphisms
by: Sason, Igal
Published: (2025)

PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
by: Hollmann, Henk D. L., et al.
Published: (2024)

Bounds on Box Codes
by: Langberg, Michael, et al.
Published: (2025)

Schubert Subspace Codes
by: Alfarano, Gianira N., et al.
Published: (2024)

Equal Requests are Asymptotically Hardest for Data Recovery
by: Lember, Jüri, et al.
Published: (2024)

Linear rank-metric intersecting codes
by: Bartoli, Daniele, et al.
Published: (2025)

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

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

A Further Investigation on Complete Complementary Codes from $q$-ary Functions
by: Sarkar, Palash, et al.
Published: (2024)

The Eigenvalue Method in Coding Theory
by: Abiad, Aida, et al.
Published: (2025)

Polynomials, Divided Differences, and Codes
by: Venkitesh, S.
Published: (2024)

The Service Rate Region of Hamming Codes
by: Choudhary, Priyanka, et al.
Published: (2025)

Intersecting Codes and the Connectivity of $q$-Matroids
by: Conca, Fabrizio, et al.
Published: (2026)

$t$-Balanced Codes with the Kendall-$τ$ Metric
by: Jany, Benjamin, et al.
Published: (2024)

Optimal Constant-Weight and Mixed-Weight Conflict-Avoiding Codes
by: Lo, Yuan-Hsun, et al.
Published: (2024)

The Geometry of Codes for Random Access in DNA Storage
by: Gruica, Anina, et al.
Published: (2024)

Maximal Recoverability: A Nexus of Coding Theory
by: Brakensiek, Joshua, et al.
Published: (2026)

Codes with restricted overlaps: expandability, constructions, and bounds
by: Stanovnik, Lidija
Published: (2024)

Binary Caps and LCD Codes with Large Dimensions
by: Ishizuka, Keita, et al.
Published: (2026)