Cover Image

Explicit Constructions for Rack-Aware Minimum Storage Partially Cooperative Regenerating Codes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhao, Hengming, Wu, Dianhua, Cheng, Minquan
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

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

A Construction Framework of Coded Caching Scheme for Multi-Access MISO Systems via Knapsack Problem
by: Luo, Siying, et al.
Published: (2026)

Order Optimal Cascaded Code Distributed Computing With Low Complexity and Improved Flexibility
by: Zhang, Mingming, et al.
Published: (2023)

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

A Transformation of Repairing Reed-Solomon Codes from Rack-Aware Storage Model to Homogeneous Storage Model
by: Yang, Yumeng, et al.
Published: (2024)

On Decentralized Linearly Separable Computation With the Minimum Computation Cost
by: Chen, Haoning, et al.
Published: (2024)

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds
by: Berman, Amit, et al.
Published: (2026)

PDA Construction via Union of Cartesian Product Cache Configurations for Coded Caching
by: Wang, Jinyu, et al.
Published: (2025)

A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Disjoint Packing
by: Cheng, Minquan, et al.
Published: (2025)

A New Construction Structure on MISO Coded Caching with Linear Subpacketization: Half-Sum Disjoint Packing
by: Zheng, Bowen, et al.
Published: (2026)

A New Construction Structure on Coded Caching with Linear Subpacketization: Non-Half-Sum Latin Rectangle
by: Yang, Yongcheng, et al.
Published: (2026)

Fundamental Limits of Coded Caching with Fixed Subpacketization
by: Cheng, Minquan, et al.
Published: (2025)

A New Construction Structure on Multi-access Coded Caching with Linear Subpacketization: Cyclic Multi-Access Non-Half-Sum Disjoint Packing
by: Li, Mengyuan, et al.
Published: (2026)

On Anti-collusion Codes for Averaging Attack in Multimedia Fingerprinting
by: Jiang, Jing, et al.
Published: (2025)

Matroidal Entropy Functions: Constructions, Characterizations and Representations
by: Chen, Qi, et al.
Published: (2023)

Proactive Coded Caching Scheme for D2D Networks
by: Zhang, Qiaoling, et al.
Published: (2026)

A Novel Coded Computing Approach for Distributed Multi-Task Learning
by: Cheng, Minquan, et al.
Published: (2025)

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

Robust Dynamic Coded Distributed Storage with Partially Storage Constrained Servers
by: Zhao, Chen, et al.
Published: (2025)

On the Optimality of Coded Distributed Computing for Ring Networks
by: Huang, Zhenhao, et al.
Published: (2025)

Improved Coded Caching Scheme for Multi-User Information Retrieval System
by: Wang, Junyi, et al.
Published: (2025)

Explicit Constructions of Sum-Rank Metric Codes from Quadratic Kummer Extensions
by: Yunlong, Zhu, et al.
Published: (2025)

Reconfigurable Intelligent Surface-Assisted Multiple-Antenna Coded Caching
by: Niu, Xiaofan, et al.
Published: (2024)

Entropy Functions on Two-Dimensional Faces of Polymatroidal Region of Degree Four: Part II: Information Theoretic Constraints Breed New Combinatorial Structures
by: Liu, Shaocheng, et al.
Published: (2025)

Multiaccess Coded Caching with Heterogeneous Retrieval Costs
by: Huang, Wenbo, et al.
Published: (2026)

Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
by: Jeronimo, Fernando Granha, et al.
Published: (2025)

A Low-Complexity Framework for Multi-access Coded Caching Systems with Arbitrary User-cache Access Topology
by: Yang, Ting, et al.
Published: (2026)

New Constructions of Full Flag Codes Based on Partial Spreads
by: Han, Xiang, et al.
Published: (2025)

Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes
by: Berman, Amit, et al.
Published: (2023)

Asymptotically ideal Disjunctive Hierarchical Secret Sharing Scheme with an Explicit Construction
by: Ding, Jian, et al.
Published: (2026)

A Novel Coded Caching Scheme for Partially Cooperative Device-to-Device Networks
by: T., Rashid Ummer N., et al.
Published: (2025)

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

Plotkin-like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels
by: K., Hareesh, et al.
Published: (2025)

New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance
by: Zheng, Lingqi, et al.
Published: (2025)

Construction Methods Based on Minimum Weight Distribution for Polar Codes with Successive Cancellation List Decoding
by: Piao, Jinnan, et al.
Published: (2023)

Cyclic and Negacyclic Codes with Optimal and Best Known Minimum Distances
by: Chen, Hao, et al.
Published: (2024)

Random Access Codes: Explicit Constructions, Optimality, and Classical-Quantum Gaps
by: Kondo, Ruho, et al.
Published: (2026)

The Rate-Immediacy Barrier in Explicit Tree Code Constructions
by: Cohen, Gil, et al.
Published: (2025)

Explicit Formula for Partial Information Decomposition
by: Lyu, Aobo, et al.
Published: (2024)

Placement Delivery Array for Cache-Aided MIMO Systems
by: Huang, Yifei, et al.
Published: (2026)