Cover Image

Maximal Achievable Service Rates of Codes and Connections to Combinatorial Designs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ly, Hoang, Soljanin, Emina
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

Service Rate Regions of MDS Codes & Fractional Matchings in Quasi-uniform Hypergraphs
by: Ly, Hoang, et al.
Published: (2025)

Optimum 1-Step Majority-Logic Decoding of Binary Reed-Muller Codes
by: Ly, Hoang, et al.
Published: (2025)

On the Service Rate Region of Reed-Muller Codes
by: Ly, Hoang, et al.
Published: (2025)

On the Redundancy of Function-Correcting Codes over Finite Fields
by: Ly, Hoang, et al.
Published: (2025)

The Service Rate Region Polytope
by: Alfarano, Gianira N., et al.
Published: (2023)

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

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025)

Redundancy Management for Fast Service (Rates) in Edge Computing Systems
by: Peng, Pei, et al.
Published: (2023)

Winning Rates of $(n,k)$ Quantum Coset Monogamy Games
by: Schleppy, Michael, et al.
Published: (2025)

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

On the Parameters of Codes for Data Access
by: Kilic, Altan B., et al.
Published: (2024)

On Optimal Batch Size in Coded Computing
by: Saha, Swapnil, et al.
Published: (2025)

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

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

Optimal Strategies for Winning Certain Coset-Guessing Quantum Games
by: Schleppy, Michael, et al.
Published: (2024)

The Oval Strikes Back
by: Di Giusto, Andrea, et al.
Published: (2026)

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

Improved Rate-versus-Distance Upper Bounds for LDPC Codes
by: Shangguan, Chong, et al.
Published: (2026)

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

Generalized Information Inequalities via Submodularity, and Two Combinatorial Problems
by: Jakhar, Gunank, et al.
Published: (2026)

A Combinatorial Perspective on Random Access Efficiency for DNA Storage
by: Gruica, Anina, et al.
Published: (2024)

Combinatorial $t$-Designs from Finite Abelian Groups and Their Applications to Elliptic Curve Codes
by: Liu, Hengfeng, et al.
Published: (2025)

On Zero Skip-Cost Generalized Fractional-Repetition Codes from Covering Designs
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)

On the Computation Rate of All-Reduce
by: Zhou, Yufeng, et al.
Published: (2026)

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)

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

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

Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
by: Mishra, Prachi, 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)

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)

On Multidimensional 2-Weight-Limited Burst-Correcting Codes
by: Berend, Hagai, et al.
Published: (2025)

Near-Optimal List-Recovery of Linear Code Families
by: Li, Ray, et al.
Published: (2025)

Polynomial Invariants of q-Matroids and Rank-Metric Codes
by: Gluesing-Luerssen, Heide, et al.
Published: (2025)

Whitney Numbers of Rank-Metric Lattices and Code Enumeration
by: Cotardo, Giuseppe, et al.
Published: (2024)