Cover Image

Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Lewen, Zhang, Zihao, Hu, Sihuang
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Constructing $(h,d)$ cooperative MSR codes with sub-packetization $(d-k+h)(d-k+1)^{\lceil n/2 \rceil}$
by: Zhang, Zihao, et al.
Published: (2024)

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

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

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

Asymptotically Optimal Repair of Reed-Solomon Codes with Small Sub-Packetization under Rack-Aware Model
by: Wang, Ke, et al.
Published: (2025)

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

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

Bidirectional Piggybacking Design for Systematic Nodes with Sub-Packetization $l=2$
by: Wang, Ke
Published: (2025)

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

Locally Repairable Convertible Codes: Improved Lower Bound and General Construction
by: Ge, Songping, et al.
Published: (2025)

The Incidence-Multiplicity Bound for Linear Exact Repair in MDS Array Codes
by: Wu, Huawei
Published: (2026)

Lower Bounds for Error Coefficients of Griesmer Optimal Linear Codes via Iteration
by: Guan, Chaofeng, et al.
Published: (2025)

Divisibility of Trace Codes
by: Huang, Hexiang, et al.
Published: (2026)

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

Linear Exact Repair in MDS Array Codes: A General Lower Bound and Its Attainability
by: Liu, Hai, et al.
Published: (2026)

New Bounds and Constructions for Variable Packet-Error Coding
by: Kong, Xiangliang, et al.
Published: (2025)

Optimal and Almost Optimal Locally Repairable Codes from Hyperelliptic Curves
by: Huang, Junjie, et al.
Published: (2025)

An Achievability Bound for Type-Based Unsourced Multiple Access
by: Krishnan, Deekshith Pathayappilly, et al.
Published: (2025)

Improved Constructions and Lower Bounds for Maximally Recoverable Grid Codes
by: Brakensiek, Joshua, et al.
Published: (2025)

New Channel Coding Lower Bounds for Noisy Permutation Channels
by: Feng, Lugaoze, et al.
Published: (2024)

Unsourced Multiple Access: A Coding Paradigm for Massive Random Access
by: Liva, Gianluigi, et al.
Published: (2024)

Rate-Optimal Streaming Codes over Three-Node Relay Networks with Burst Erasures
by: Li, Zhipeng, et al.
Published: (2025)

Hierarchical Gradient Coding: From Optimal Design to Privacy at Intermediate Nodes
by: Gholami, Ali, et al.
Published: (2025)

Accelerating Data Access for Single Node in Distributed Storage Systems via MDS Codes
by: Shi, Hao, et al.
Published: (2025)

Tight Lower Bounds on The Single-Error Detection Threshold for Analog Error-Correcting Codes
by: Jiang, Zhengyi, et al.
Published: (2026)

Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model
by: Yang, Yumeng, et al.
Published: (2024)

Simple Bounds for the Symmetric Capacity of the Rayleigh Fading Multiple Access Channel
by: Domanovitz, Elad, et al.
Published: (2019)

Tight Lower Bounds on the Bandwidth Cost of MDS Convertible Codes in the Split Regime
by: Singhvi, Shubhransh, et al.
Published: (2025)

Upper Bounds on Multiple $b$-Burst Deletion-Correcting Codes
by: Wang, Chen, et al.
Published: (2026)

Trace Repair Never Loses to Classical Repair: Exact and Explicit Helper Nodes Selection
by: Kim, Wilton, et al.
Published: (2025)

Minimax Optimality of Score-based Diffusion Models: Beyond the Density Lower Bound Assumptions
by: Zhang, Kaihong, et al.
Published: (2024)

Bounds and Optimal Constructions of Generalized Merge-Convertible Codes for Code Conversion into LRCs
by: Shi, Haoming, et al.
Published: (2025)

Lower Bounds on Pauli Manipulation Detection Codes
by: Ichikawa, Keiya, et al.
Published: (2025)

On Low Field Size Constructions of Access-Optimal Convertible Codes
by: Chopra, Saransh, et al.
Published: (2024)

Worst-Case Per-User Error Bound for Asynchronous Unsourced Multiple Access
by: Wu, Jyun-Sian, et al.
Published: (2024)

Self-Dual Cyclic Codes with Square-Root-Like Lower Bounds on Their Minimum Distances
by: Chen, Hao, et al.
Published: (2024)

Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach
by: Qiu, Jing, et al.
Published: (2026)