Imagen de Portada

Constructing $(h,d)$ cooperative MSR codes with sub-packetization $(d-k+h)(d-k+1)^{\lceil n/2 \rceil}$

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhang, Zihao, Li, Guodong, Hu, Sihuang
Formato:	Preprint
Publicado:	2024
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimal Repair of $(k+2, k, 2)$ MDS Array Codes
por: Zhang, Zihao, et al.
Publicado: (2025)

MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes
por: Li, Guodong, et al.
Publicado: (2023)

Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair
por: Wang, Lewen, et al.
Publicado: (2025)

New Centralized MSR Codes With Small Sub-packetization
por: Zhang, Yaqian
Publicado: (2024)

Reducing The Sub-packetization Level of Optimal-Access Cooperative MSR Codes
por: Zhang, Yaqian, et al.
Publicado: (2026)

Efficient Repair of (k+2, k) Degraded Read Friendly MDS Array Codes With Sub-packetization 2
por: Li, Jie, et al.
Publicado: (2025)

Some classes of connected signed graphs with girth $g$ and negative inertia index $\lceil\frac{g}{2}\rceil+1$
por: Liu, BeiYan, et al.
Publicado: (2026)

On lattice tilings of $\mathbb{Z}^n$ by limited magnitude error balls $\mathcal{B}(n,2,k_{1},k_{2})$ with $k_1>k_2$
por: Leung, Ka Hin, et al.
Publicado: (2025)

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

Constructing Hamiltonian Decompositions of Complete $k$-Uniform Hypergraphs
por: Maheri, Javad, et al.
Publicado: (2025)

Quantum Advantages in (n,d)->1 Random Access Codes
por: Ambainis, Andris, et al.
Publicado: (2015)

Bounds on $k$-hash distances and rates of linear codes
por: Della Fiore, Stefano, et al.
Publicado: (2025)

Geometric construction of k-optimal locally repairable codes
por: Fu, Yi, et al.
Publicado: (2026)

$\varepsilon$-MSR Codes for Any Set of Helper Nodes
por: Ramkumar, Vinayak, et al.
Publicado: (2024)

A Cooperative Repair Scheme for Zigzag MSR Codes in Distributed Storage Systems
por: Liu, Yajuan, et al.
Publicado: (2025)

New constructions of $2$-to-$1$ mappings over $\gf_{2^n}$ and their applications to binary linear codes
por: Li, Yaqin, et al.
Publicado: (2025)

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

Generic Construction of Optimal-Access Binary MDS Array Codes with Smaller Sub-packetization
por: Ma, Lan, et al.
Publicado: (2025)

Divisibility of Trace Codes
por: Huang, Hexiang, et al.
Publicado: (2026)

Constructing $k$-ary Orientable Sequences with Asymptotically Optimal Length
por: Gabrić, Daniel, et al.
Publicado: (2024)

Optimal $(2,δ)$ Locally Repairable Codes via Punctured Simplex Codes
por: Gao, Yuan, et al.
Publicado: (2023)

Asymptotics of the d'Arcais Numbers at Small $k$
por: Starr, Shannon
Publicado: (2026)

Universal cycle constructions for k-subsets and k-multisets
por: Campbell, Colin, et al.
Publicado: (2026)

Rack-Aware MSR Codes with Linear Field Size and Smaller Sub-Packetization for Tolerating Multiple Erasures
por: Zhao, Hengming, et al.
Publicado: (2025)

On the Fluctuations of the Single-Letter $d$-Tilted Sum for Binary Markov Sources
por: Krishnamachari, Bhaskar
Publicado: (2026)

Conditional Entropies of k-Deletion/Insertion Channels
por: Singhvi, Shubhransh, et al.
Publicado: (2024)

A Construction of Evolving $k$-threshold Secret Sharing Scheme over A Polynomial Ring
por: Cheng, Qi, et al.
Publicado: (2024)

Age of $k$-out-of-$n$ Systems on a Gossip Network
por: Bayram, Erkan, et al.
Publicado: (2024)

Probabilistic Shaping in MIMO: Going Beyond 1.53dB AWGN Gain With the Non-Linear Demapper
por: Ivanov, Kirill, et al.
Publicado: (2025)

On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
por: Cheng, Kuan, et al.
Publicado: (2023)

Binary $[n,(n\pm1)/2]$ cyclic codes with good minimum distances from sequences
por: Xie, Xianhong, et al.
Publicado: (2024)

Constructions of locally repairable codes via concatenated codes
por: Jin, Hengfeng, et al.
Publicado: (2026)

Explicit estimates for the sum $\sum_{k=0}^{n} k! {n\choose k}^2 (-1)^{k}$
por: Ernvall-Hytönen, Anne-Maria, et al.
Publicado: (2023)

Upper bounds on the rate of linear $q$-ary $k$-hash codes
por: Della Fiore, Stefano, et al.
Publicado: (2024)

Construction of $(n,n)$-functions with low differential-linear uniformity
por: Xie, Xi, et al.
Publicado: (2025)

Set Transformation: Trade-off Between Repair Bandwidth and Sub-packetization
por: Shi, Hao, et al.
Publicado: (2024)

Nonvanishing $k$-flats of Boolean and vectorial functions
por: Kaspers, Christian
Publicado: (2026)

Two-Class Joint Source-Channel Coding: Expurgated Exponents with i.i.d. Distributions
por: Moeini, Seyed AmirPouya, et al.
Publicado: (2026)

The Empirical Spectral Distribution of i.i.d. Random Matrices with Random Perturbations
por: Chen, Kun, et al.
Publicado: (2024)

On the largest minimum distances of [n,6] LCD codes
por: Liu, Yang, et al.
Publicado: (2024)