Image de couverture de livre

Optimal Erasure Codes and Codes on Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Yeyuan, Cheraghchi, Mahdi, Shagrithaya, Nikhil
Format:	Preprint
Publié:	2025
Sujets:	Information Theory Discrete Mathematics Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
par: Wu, Huawei
Publié: (2026)

Permutation and Multi-permutation Codes Correcting Multiple Deletions
par: Wang, Shuche, et autres
Publié: (2024)

Improved Upper Bound for the Size of a Trifferent Code
par: Bhandari, Siddharth, et autres
Publié: (2024)

Unique-neighbor Expanders with Better Expansion for Polynomial-sized Sets
par: Chen, Yeyuan
Publié: (2024)

Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
par: Goyal, Keshav, et autres
Publié: (2024)

Near-Optimal List-Recovery of Linear Code Families
par: Li, Ray, et autres
Publié: (2025)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
par: Gabrić, Daniel, et autres
Publié: (2024)

Automated Discovery of Improved Constant Weight Binary Codes
par: Rosin, Christopher D.
Publié: (2026)

Error-Correcting Graph Codes
par: Kopparty, Swastik, et autres
Publié: (2024)

Improved Constructions of Skew-Tolerant Gray Codes
par: Himelfarb, Gabriel Sac, et autres
Publié: (2024)

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
par: Chen, Yeyuan
Publié: (2024)

The Labeled Coupon Collector Problem
par: Tan, Andrew, et autres
Publié: (2025)

Reconstructing graphs with subgraph compositions
par: Dailly, Antoine, et autres
Publié: (2025)

On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
par: Yu, Lei
Publié: (2025)

On the Codebook Design for NOMA Schemes from Bent Functions
par: Li, Chunlei, et autres
Publié: (2025)

Universal cycle constructions for k-subsets and k-multisets
par: Campbell, Colin, et autres
Publié: (2026)

Generalized Three and Four Person Hat Game
par: van Uem, Theo
Publié: (2017)

Threshold rates for properties of random codes
par: Guruswami, Venkatesan, et autres
Publié: (2020)

Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
par: Mizunuma, Yuto, et autres
Publié: (2026)

Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
par: Gabric, Daniel, et autres
Publié: (2026)

Evaluating the Gilbert-Varshamov Bound for Constrained Systems
par: Goyal, Keshav, et autres
Publié: (2024)

AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
par: Alrabiah, Omar, et autres
Publié: (2023)

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $τ$-Metric
par: Nguyen, The
Publié: (2024)

Ramanujan Graphs and Interlacing Families
par: Srivastava, Nikhil
Publié: (2024)

The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
par: Wang, Geyang, et autres
Publié: (2025)

Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
par: Aigner-Horev, Elad, et autres
Publié: (2023)

Recoverable systems and the maximal hard-core model on the triangular lattice
par: Wang, Geyang, et autres
Publié: (2026)

The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
par: Liang, Xue-Bin
Publié: (2024)

On the Structure of the Linear Codes with a Given Automorphism
par: Bouyuklieva, Stefka
Publié: (2023)

Progress on Self Identifying Codes
par: Jean, Devin, et autres
Publié: (2025)

Millions of inequivalent quadratic APN functions in eight variables
par: Beierle, Christof, et autres
Publié: (2025)

When does a bent concatenation not belong to the completed Maiorana-McFarland class?
par: Kudin, Sadmir, et autres
Publié: (2024)

Nearly Orthogonal Sets over Finite Fields
par: Chawin, Dror, et autres
Publié: (2024)

The Fundamental Limits of Recovering Planted Subgraphs
par: Lee, Daniel, et autres
Publié: (2025)

A Method for Generating Connected Erdos-Renyi Random Graphs
par: Chinyaev, Boris
Publié: (2025)

On Function-Correcting Codes in the Lee Metric
par: Verma, Gyanendra K., et autres
Publié: (2025)

Reducing Data Fragmentation in Data Deduplication Systems via Partial Repetition and Coding
par: Li, Yun-Han, et autres
Publié: (2024)

Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
par: Liu, Hai, et autres
Publié: (2026)

A Group Theoretic Construction of Batch Codes
par: Thomas, Eldho K.
Publié: (2025)