Image de couverture de livre

On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yu, Wenjun, Yuan, Bo-Jun, Schwartz, Moshe
Format:	Preprint
Publié:	2025
Sujets:	Information Theory Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Duplication-Free Codes for Disjoint or Equal-Length Errors
par: Yu, Wenjun, et autres
Publié: (2024)

Optimal Reconstruction Codes with Given Reads in Multiple Burst-Substitutions Channels
par: Yu, Wenjun, et autres
Publié: (2025)

Bounds on Box Codes
par: Langberg, Michael, et autres
Publié: (2025)

On Multidimensional 2-Weight-Limited Burst-Correcting Codes
par: Berend, Hagai, et autres
Publié: (2025)

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

On the Asymptotic Rate of Optimal Codes that Correct Tandem Duplications for Nanopore Sequencing
par: Yu, Wenjun, et autres
Publié: (2024)

Storage codes on coset graphs with asymptotically unit rate
par: Barg, Alexander, et autres
Publié: (2022)

The Second Generalized Covering Radius of Binary Primitive Double-Error-Correcting BCH Codes
par: Yohananov, Lev, et autres
Publié: (2024)

On the Capacity of Sequences of Coloring Channels
par: Yu, Wenjun, et autres
Publié: (2026)

Repairing with Zero Skip Cost
par: Zhang, Wenqin, et autres
Publié: (2024)

Service Rate Regions of MDS Codes & Fractional Matchings in Quasi-uniform Hypergraphs
par: Ly, Hoang, et autres
Publié: (2025)

The Support Designs of Several Families of Lifted Linear Codes
par: Ding, Cunsheng, et autres
Publié: (2024)

A Generic Construction of $q$-ary Near-MDS Codes Supporting 2-Designs with Lengths Beyond $q+1$
par: Liu, Hengfeng, et autres
Publié: (2025)

Maximal Achievable Service Rates of Codes and Connections to Combinatorial Designs
par: Ly, Hoang, et autres
Publié: (2025)

On the Coding Capacity of Reverse-Complement and Palindromic Duplication-Correcting Codes
par: Yohananov, Lev, et autres
Publié: (2023)

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
par: Guo, Zeyu, et autres
Publié: (2024)

Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds
par: Chen, Yeyuan, et autres
Publié: (2024)

A Survey on Codes from Simplicial Complexes
par: Wu, Yansheng, et autres
Publié: (2024)

PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
par: Hollmann, Henk D. L., et autres
Publié: (2024)

Schubert Subspace Codes
par: Alfarano, Gianira N., et autres
Publié: (2024)

Generalized Orthogonal de Bruijn and Kautz Sequences
par: Chen, Yuan-Pon, et autres
Publié: (2025)

The Eigenvalue Method in Coding Theory
par: Abiad, Aida, et autres
Publié: (2025)

Polynomials, Divided Differences, and Codes
par: Venkitesh, S.
Publié: (2024)

The Service Rate Region of Hamming Codes
par: Choudhary, Priyanka, et autres
Publié: (2025)

Intersecting Codes and the Connectivity of $q$-Matroids
par: Conca, Fabrizio, et autres
Publié: (2026)

$t$-Balanced Codes with the Kendall-$τ$ Metric
par: Jany, Benjamin, et autres
Publié: (2024)

A Further Investigation on Complete Complementary Codes from $q$-ary Functions
par: Sarkar, Palash, et autres
Publié: (2024)

The Geometry of Codes for Random Access in DNA Storage
par: Gruica, Anina, et autres
Publié: (2024)

Maximal Recoverability: A Nexus of Coding Theory
par: Brakensiek, Joshua, et autres
Publié: (2026)

Codes with restricted overlaps: expandability, constructions, and bounds
par: Stanovnik, Lidija
Publié: (2024)

Binary Caps and LCD Codes with Large Dimensions
par: Ishizuka, Keita, et autres
Publié: (2026)

Double-Cover-Based Analysis of the Bethe Permanent of Block-Structured Positive Matrices
par: Wu, Binghong, et autres
Publié: (2026)

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

Polynomial Invariants of q-Matroids and Rank-Metric Codes
par: Gluesing-Luerssen, Heide, et autres
Publié: (2025)

Whitney Numbers of Rank-Metric Lattices and Code Enumeration
par: Cotardo, Giuseppe, et autres
Publié: (2024)

Improved Johnson-type Bounds for Insertion-Deletion Codes
par: Yang, Yulin
Publié: (2026)

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

Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars
par: Wei, Hengjia, et autres
Publié: (2024)

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
par: Shangguan, Chong, et autres
Publié: (2026)

Counterexamples, Constructions, and Nonexistence Results for Optimal Ternary Cyclic Codes
par: Bao, Jingjun, et autres
Publié: (2026)