Reducing The Sub-packetization Level of Optimal-Access Cooperative MSR Codes
Fuente:
arXiv
Saved in:
| Main Authors: | Zhang, Yaqian, Xu, Jingke |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
New Centralized MSR Codes With Small Sub-packetization
by: Zhang, Yaqian
Published: (2024)
by: Zhang, Yaqian
Published: (2024)
Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair
by: Wang, Lewen, et al.
Published: (2025)
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)
by: Li, Guodong, et al.
Published: (2023)
Generic Construction of Optimal-Access Binary MDS Array Codes with Smaller Sub-packetization
by: Ma, Lan, et al.
Published: (2025)
by: Ma, Lan, et al.
Published: (2025)
A Cooperative Repair Scheme for Zigzag MSR Codes in Distributed Storage Systems
by: Liu, Yajuan, et al.
Published: (2025)
by: Liu, Yajuan, et al.
Published: (2025)
Rack-Aware MSR Codes with Linear Field Size and Smaller Sub-Packetization for Tolerating Multiple Erasures
by: Zhao, Hengming, et al.
Published: (2025)
by: Zhao, Hengming, et al.
Published: (2025)
$\varepsilon$-MSR Codes for Any Set of Helper Nodes
by: Ramkumar, Vinayak, et al.
Published: (2024)
by: Ramkumar, Vinayak, et al.
Published: (2024)
Asymptotically Optimal Repair of Reed-Solomon Codes with Small Sub-Packetization under Rack-Aware Model
by: Wang, Ke, et al.
Published: (2025)
by: Wang, Ke, 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)
by: Zhang, Zihao, et al.
Published: (2024)
Calculating the I/O Cost of Linear Repair Schemes for RS Codes Evaluated on Subspaces via Exponential Sums
by: Liu, Zhongyan, et al.
Published: (2024)
by: Liu, Zhongyan, et al.
Published: (2024)
Deep Holes of Twisted Reed-Solomon Codes
by: Fang, Weijun, et al.
Published: (2024)
by: Fang, Weijun, et al.
Published: (2024)
Achieving Capacity of PIR with Private Side Information with Low Sub-packetization and without MDS Codes
by: Erhili, Leila, et al.
Published: (2024)
by: Erhili, Leila, et al.
Published: (2024)
Optimal $(2,δ)$ Locally Repairable Codes via Punctured Simplex Codes
by: Gao, Yuan, et al.
Published: (2023)
by: Gao, Yuan, et al.
Published: (2023)
Set Transformation: Trade-off Between Repair Bandwidth and Sub-packetization
by: Shi, Hao, et al.
Published: (2024)
by: Shi, Hao, et al.
Published: (2024)
Efficient Repair of (k+2, k) Degraded Read Friendly MDS Array Codes With Sub-packetization 2
by: Li, Jie, et al.
Published: (2025)
by: Li, Jie, et al.
Published: (2025)
A Disguise-and-Squeeze PIR Scheme for the MDS-TPIR Setting and Beyond
by: Sun, Rui, et al.
Published: (2026)
by: Sun, Rui, et al.
Published: (2026)
On Low Field Size Constructions of Access-Optimal Convertible Codes
by: Chopra, Saransh, et al.
Published: (2024)
by: Chopra, Saransh, et al.
Published: (2024)
New $X$-Secure $T$-Private Information Retrieval Schemes via Rational Curves and Hermitian Curves
by: Gao, Yuan, et al.
Published: (2026)
by: Gao, Yuan, et al.
Published: (2026)
Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps
by: Kondo, Ruho, et al.
Published: (2026)
by: Kondo, Ruho, et al.
Published: (2026)
On the Parameters of Codes for Data Access
by: Kilic, Altan B., et al.
Published: (2024)
by: Kilic, Altan B., et al.
Published: (2024)
Optimal Codes with Positive Griesmer Defects, Related Optimal and Almost Optimal LRC Codes
by: Wang, Yurui, et al.
Published: (2026)
by: Wang, Yurui, et al.
Published: (2026)
Asymptotically Optimal Codes for $(t,s)$-Burst Error
by: Sun, Yubo, et al.
Published: (2024)
by: Sun, Yubo, et al.
Published: (2024)
Unsourced Multiple Access: A Coding Paradigm for Massive Random Access
by: Liva, Gianluigi, et al.
Published: (2024)
by: Liva, Gianluigi, et al.
Published: (2024)
Coding-Enhanced Cooperative Jamming for Secret Communication: The MIMO Case
by: Xu, Hao, et al.
Published: (2022)
by: Xu, Hao, et al.
Published: (2022)
On the Error-Reducing Properties of Superposition Codes
by: Andreev, Kirill, et al.
Published: (2023)
by: Andreev, Kirill, et al.
Published: (2023)
On the Optimality of Decode and Forward for Some Cooperative Broadcast Channels
by: Gouic, Nicolas Le, et al.
Published: (2026)
by: Gouic, Nicolas Le, et al.
Published: (2026)
Necessity of Cooperative Transmissions for Wireless MapReduce
by: Bi, Yue, et al.
Published: (2026)
by: Bi, Yue, et al.
Published: (2026)
Optimal Multidimensional Convolutional Codes
by: Abreu, Z., et al.
Published: (2026)
by: Abreu, Z., et al.
Published: (2026)
Reducing Subpacketization in Device-to-Device Coded Caching via Heterogeneous File Splitting
by: Zhang, Xiang, et al.
Published: (2026)
by: Zhang, Xiang, et al.
Published: (2026)
Optimal Few-GHW Linear Codes and Their Subcode Support Weight Distributions
by: Pan, Xu, et al.
Published: (2024)
by: Pan, Xu, et al.
Published: (2024)
Random Access Expectation in DNA Storage and Fountain Codes
by: Hofmeister, Christoph, et al.
Published: (2026)
by: Hofmeister, Christoph, et al.
Published: (2026)
Pilot-Free Unsourced Random Access Via Dictionary Learning and Error-Correcting Codes
by: Zhang, Zhentian, et al.
Published: (2023)
by: Zhang, Zhentian, et al.
Published: (2023)
Non-Binary Covering Codes for Low-Access Computations
by: Ramkumar, Vinayak, et al.
Published: (2024)
by: Ramkumar, Vinayak, et al.
Published: (2024)
Combinatorial Multi-Access Coded Caching with Private Caches
by: Singh, Dhruv Pratap, et al.
Published: (2024)
by: Singh, Dhruv Pratap, et al.
Published: (2024)
Quasi-Perfect and Distance-Optimal Codes Sum-Rank Codes
by: Chen, Hao
Published: (2024)
by: Chen, Hao
Published: (2024)
A Characterization of Optimal Prefix Codes
by: Congero, Spencer, et al.
Published: (2023)
by: Congero, Spencer, et al.
Published: (2023)
Coding-Enhanced Cooperative Jamming for Secret Communication in Fluid Antenna Systems
by: Xu, Hao, et al.
Published: (2024)
by: Xu, Hao, et al.
Published: (2024)
Combinatorial Multi-Access Coded Caching: Improved Rate-Memory Trade-off with Coded Placement
by: Namboodiri, K. K. Krishnan, et al.
Published: (2022)
by: Namboodiri, K. K. Krishnan, et al.
Published: (2022)
The Geometry of Codes for Random Access in DNA Storage
by: Gruica, Anina, et al.
Published: (2024)
by: Gruica, Anina, et al.
Published: (2024)
Sparse Code Transceiver Design for Unsourced Random Access with Analytical Power Division in Gaussian MAC
by: Zhang, Zhentian, et al.
Published: (2025)
by: Zhang, Zhentian, et al.
Published: (2025)
Similar Items
-
New Centralized MSR Codes With Small Sub-packetization
by: Zhang, Yaqian
Published: (2024) -
Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair
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) -
Generic Construction of Optimal-Access Binary MDS Array Codes with Smaller Sub-packetization
by: Ma, Lan, et al.
Published: (2025) -
A Cooperative Repair Scheme for Zigzag MSR Codes in Distributed Storage Systems
by: Liu, Yajuan, et al.
Published: (2025)