Optimal Repair Bandwidth and Repair I/O of $(n,n-2,2)$ MDS Array Codes
Fuente:
arXiv
Saved in:
| Main Author: | Wu, Huawei |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
by: Liu, Hai, et al.
Published: (2026)
by: Liu, Hai, et al.
Published: (2026)
Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025)
by: Chen, Yeyuan, et al.
Published: (2025)
Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024)
by: Wang, Shuche, et al.
Published: (2024)
Improved Upper Bound for the Size of a Trifferent Code
by: Bhandari, Siddharth, et al.
Published: (2024)
by: Bhandari, Siddharth, et al.
Published: (2024)
Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)
by: Gabrić, Daniel, et al.
Published: (2024)
Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
by: Goyal, Keshav, et al.
Published: (2024)
by: Goyal, Keshav, et al.
Published: (2024)
Universal cycle constructions for k-subsets and k-multisets
by: Campbell, Colin, et al.
Published: (2026)
by: Campbell, Colin, et al.
Published: (2026)
Asymptotic Rate Bounds and Constructions for the Inclusive Variant of Disjunct Matrices
by: Mizunuma, Yuto, et al.
Published: (2026)
by: Mizunuma, Yuto, et al.
Published: (2026)
Decoding universal cycles for t-subsets and t-multisets by decoding bounded-weight de Bruijn sequences
by: Gabric, Daniel, et al.
Published: (2026)
by: Gabric, Daniel, et al.
Published: (2026)
Generalized Three and Four Person Hat Game
by: van Uem, Theo
Published: (2017)
by: van Uem, Theo
Published: (2017)
Threshold rates for properties of random codes
by: Guruswami, Venkatesan, et al.
Published: (2020)
by: Guruswami, Venkatesan, et al.
Published: (2020)
The Labeled Coupon Collector Problem
by: Tan, Andrew, et al.
Published: (2025)
by: Tan, Andrew, et al.
Published: (2025)
Reconstructing graphs with subgraph compositions
by: Dailly, Antoine, et al.
Published: (2025)
by: Dailly, Antoine, et al.
Published: (2025)
On Average Distance, Level-1 Fourier Weight, and Chang's Lemma
by: Yu, Lei
Published: (2025)
by: Yu, Lei
Published: (2025)
Evaluating the Gilbert-Varshamov Bound for Constrained Systems
by: Goyal, Keshav, et al.
Published: (2024)
by: Goyal, Keshav, et al.
Published: (2024)
On the Codebook Design for NOMA Schemes from Bent Functions
by: Li, Chunlei, et al.
Published: (2025)
by: Li, Chunlei, et al.
Published: (2025)
AG codes have no list-decoding friends: Approaching the generalized Singleton bound requires exponential alphabets
by: Alrabiah, Omar, et al.
Published: (2023)
by: Alrabiah, Omar, et al.
Published: (2023)
Automated Discovery of Improved Constant Weight Binary Codes
by: Rosin, Christopher D.
Published: (2026)
by: Rosin, Christopher D.
Published: (2026)
Substitution discrete plane tilings with $2n$-fold rotational symmetry for odd n
by: Kari, Jarkko, et al.
Published: (2020)
by: Kari, Jarkko, et al.
Published: (2020)
Improved Constructions of Skew-Tolerant Gray Codes
by: Himelfarb, Gabriel Sac, et al.
Published: (2024)
by: Himelfarb, Gabriel Sac, et al.
Published: (2024)
Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)
by: Wang, Geyang, et al.
Published: (2026)
Smoothed Analysis of the Komlós Conjecture: Rademacher Noise
by: Aigner-Horev, Elad, et al.
Published: (2023)
by: Aigner-Horev, Elad, et al.
Published: (2023)
The maximal hard-core model as a recoverable system: Gibbs measures and phase coexistence
by: Wang, Geyang, et al.
Published: (2025)
by: Wang, Geyang, et al.
Published: (2025)
The exact value of $c_1(K_{2,n})$
by: Mori, Hiroaki
Published: (2026)
by: Mori, Hiroaki
Published: (2026)
The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q
by: Liang, Xue-Bin
Published: (2024)
by: Liang, Xue-Bin
Published: (2024)
Fortuitous sequences of flips of the top of a stack of n burnt pancakes for all n>24
by: Pierre, Laurent
Published: (2016)
by: Pierre, Laurent
Published: (2016)
When does a bent concatenation not belong to the completed Maiorana-McFarland class?
by: Kudin, Sadmir, et al.
Published: (2024)
by: Kudin, Sadmir, et al.
Published: (2024)
Millions of inequivalent quadratic APN functions in eight variables
by: Beierle, Christof, et al.
Published: (2025)
by: Beierle, Christof, et al.
Published: (2025)
Nearly Orthogonal Sets over Finite Fields
by: Chawin, Dror, et al.
Published: (2024)
by: Chawin, Dror, et al.
Published: (2024)
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2n$ Rounds
by: Frieze, Alan, et al.
Published: (2023)
by: Frieze, Alan, et al.
Published: (2023)
The Fundamental Limits of Recovering Planted Subgraphs
by: Lee, Daniel, et al.
Published: (2025)
by: Lee, Daniel, et al.
Published: (2025)
Construction of orientable sequences in $O(1)$-amortized time per bit
by: Gabric, Daniel, et al.
Published: (2024)
by: Gabric, Daniel, et al.
Published: (2024)
Large planar $(n,m)$-cliques
by: Bandopadhyay, Susobhan, et al.
Published: (2024)
by: Bandopadhyay, Susobhan, et al.
Published: (2024)
Improving the Gilbert-Varshamov bound for permutation Codes in the Cayley metric and Kendall $τ$-Metric
by: Nguyen, The
Published: (2024)
by: Nguyen, The
Published: (2024)
Planar Rosa : a family of quasiperiodic substitution discrete plane tilings with $2n$-fold rotational symmetry
by: Kari, Jarkko, et al.
Published: (2022)
by: Kari, Jarkko, et al.
Published: (2022)
The Incidence-Multiplicity Bound for Linear Exact Repair in MDS Array Codes
by: Wu, Huawei
Published: (2026)
by: Wu, Huawei
Published: (2026)
Error-Correcting Graph Codes
by: Kopparty, Swastik, et al.
Published: (2024)
by: Kopparty, Swastik, et al.
Published: (2024)
The Graph Coloring Game on $4\times n$-Grids
by: Brosse, Caroline, et al.
Published: (2024)
by: Brosse, Caroline, et al.
Published: (2024)
Homomorphisms of (n,m)-graphs with respect to generalised switch
by: Sen, Sagnik, et al.
Published: (2022)
by: Sen, Sagnik, et al.
Published: (2022)
A concentration phenomenon for $h$-extra edge-connectivity reliability analysis of enhanced hypercubes $Q_{n,2}$ with exponentially many faulty links
by: Sun, Yali, et al.
Published: (2024)
by: Sun, Yali, et al.
Published: (2024)
Similar Items
-
Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
by: Liu, Hai, et al.
Published: (2026) -
Optimal Erasure Codes and Codes on Graphs
by: Chen, Yeyuan, et al.
Published: (2025) -
Permutation and Multi-permutation Codes Correcting Multiple Deletions
by: Wang, Shuche, et al.
Published: (2024) -
Improved Upper Bound for the Size of a Trifferent Code
by: Bhandari, Siddharth, et al.
Published: (2024) -
Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
by: Gabrić, Daniel, et al.
Published: (2024)