Cover Image

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Brakensiek, Joshua, Dhar, Manik, Gopi, Sivakanth
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Field Size Bounds for Higher Order MDS Codes
by: Brakensiek, Joshua, et al.
Published: (2022)

Generalized GM-MDS: Polynomial Codes are Higher Order MDS
by: Brakensiek, Joshua, et al.
Published: (2023)

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

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

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

Rigidity matroids and linear algebraic matroids with applications to matrix completion and tensor codes
by: Brakensiek, Joshua, et al.
Published: (2024)

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

Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors
by: Brakensiek, Joshua, 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)

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage
by: Srinivasavaradhan, Sundara Rajan, et al.
Published: (2021)

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
by: Ge, Songping, et al.
Published: (2025)

Secure Storage using Maximally Recoverable Locally Repairable Codes
by: Janz, Tim, et al.
Published: (2024)

Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
by: Dang, Sakshi, et al.
Published: (2026)

A Geometric Perspective on the Injective Norm of Sums of Random Tensors
by: Bandeira, Afonso S., et al.
Published: (2024)

$q$-ary Sequential Locally Recoverable Codes from the Product Construction
by: Baghban, Akram, et al.
Published: (2024)

A Construction of Optimal Quasi-cyclic Locally Recoverable Codes using Constituent Codes
by: Bastos, Gustavo Terra, et al.
Published: (2024)

Quantum Locally Recoverable Codes via Good Polynomials
by: Sharma, Sandeep, et al.
Published: (2024)

Redundancy Is All You Need (for CSP Sparsification)
by: Brakensiek, Joshua, et al.
Published: (2024)

Improved Probabilistic Lower Bounds for Separable Matrices
by: Goshkoder, Daniil, et al.
Published: (2024)

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

New Construction of Locally q-ary Sequential Recoverable Codes: Parity-check Matrix Approach
by: Baghban, Akram, et al.
Published: (2025)

New Channel Coding Lower Bounds for Noisy Permutation Channels
by: Feng, Lugaoze, et al.
Published: (2024)

Multiset Deletion-Correcting Codes: Bounds and Constructions
by: Kreindel, Avraham, et al.
Published: (2026)

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

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

Lower Bounds on Conversion Bandwidth for MDS Convertible Codes in Split Regime
by: Wang, Lewen, et al.
Published: (2025)

Bounds and Constructions of High-Memory Spatially-Coupled Codes
by: Huang, Lei
Published: (2025)

Bounds and Constructions of Codes for Ordered Composite DNA Sequences
by: Ye, Zuo, et al.
Published: (2026)

An Improved Lower Bound on Cardinality of Support of the Amplitude-Constrained AWGN Channel
by: Wang, Haiyang, et al.
Published: (2025)

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

Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
by: Shi, Haoming, et al.
Published: (2025)

An Improved Lower Bound on Oblivious Transfer Capacity Using Polarization and Interaction
by: Suda, So, et al.
Published: (2025)

Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration
by: Guan, Chaofeng, et al.
Published: (2025)

Tight Lower Bounds on the Bandwidth Cost of MDS Convertible Codes in the Split Regime
by: Singhvi, Shubhransh, et al.
Published: (2025)

Majority-Logic Decoding of Binary Locally Recoverable Codes: A Probabilistic Analysis
by: Ly, Hoang, et al.
Published: (2026)

Bounds and Constructions of $\ell$-Read Codes under the Hamming Metric
by: Sun, Yubo, et al.
Published: (2024)

Griesmer Bound and Constructions of Linear Codes in $b$-Symbol Metric
by: Luo, Gaojun, et al.
Published: (2024)

On Grid Codes
by: García-Claro, E. J., et al.
Published: (2022)

Lower Bounds on Pauli Manipulation Detection Codes
by: Ichikawa, Keiya, et al.
Published: (2025)

Improved Constructions of Linear Codes for Insertions and Deletions
by: Gross, Roee, et al.
Published: (2025)