Cover Image

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jeronimo, Fernando Granha, 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

Near-Optimal List-Recovery of Linear Code Families
by: Li, Ray, 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)

Explicit Codes approaching Generalized Singleton Bound using Expanders
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

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

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

Explicit Entropic Constructions for Coverage, Facility Location, and Graph Cuts
by: Iyer, Rishabh
Published: (2026)

Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
by: Jeronimo, Fernando Granha, et al.
Published: (2026)

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

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

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

A New Construction of Non-Binary Deletion Correcting Codes and their Decoding
by: Schaller, Michael, et al.
Published: (2025)

Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness
by: Coregliano, Leonardo Nagami, et al.
Published: (2025)

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

On the Construction of Recursively Differentiable Quasigroups and an Example of a Recursive $[4,2,3]_{26}$-Code
by: Klimov, Petr
Published: (2026)

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

Explicit constructions of optimal blocking sets and minimal codes
by: Bishnoi, Anurag, et al.
Published: (2024)

List Decodable Quantum LDPC Codes
by: Bergamaschi, Thiago, et al.
Published: (2024)

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

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

New Correlation Bound and Construction of Quasi-Complementary Code Sets
by: Sarkar, Palash, et al.
Published: (2022)

Explicit Rank Extractors and Subspace Designs via Function Fields, with Applications to Strong Blocking Sets
by: Guo, Zeyu, et al.
Published: (2026)

Explicit determination of a class of permutation rational functions in any characteristic
by: Li, Yi, et al.
Published: (2026)

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

Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes
by: First, Uriya A., et al.
Published: (2024)

Explicit Good Codes Approaching Distance 1 in Ulam Metric
by: Goldenberg, Elazar, 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)

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

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

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

Matroidal Entropy Functions: Constructions, Characterizations and Representations
by: Chen, Qi, et al.
Published: (2023)

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)

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)

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

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