Asymptotically Optimal Repair of Reed-Solomon Codes with Small Sub-Packetization under Rack-Aware Model
Fuente:
arXiv
Guardado en:
| Autores principales: | Wang, Ke, Liu, Zhongyan, Li, Rengang, Zhao, Yaqian, Zhang, Yaqiang |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes
por: Liu, Zhongyan, et al.
Publicado: (2024)
por: Liu, Zhongyan, et al.
Publicado: (2024)
A Transformation of Repairing Reed-Solomon Codes from Rack-Aware Storage Model to Homogeneous Storage Model
por: Yang, Yumeng, et al.
Publicado: (2024)
por: Yang, Yumeng, et al.
Publicado: (2024)
Rack-Aware MSR Codes with Linear Field Size and Smaller Sub-Packetization for Tolerating Multiple Erasures
por: Zhao, Hengming, et al.
Publicado: (2025)
por: Zhao, Hengming, et al.
Publicado: (2025)
Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model
por: Yang, Yumeng, et al.
Publicado: (2024)
por: Yang, Yumeng, et al.
Publicado: (2024)
Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach
por: Qiu, Jing, et al.
Publicado: (2026)
por: Qiu, Jing, et al.
Publicado: (2026)
Private Repair of a Single Erasure in Reed-Solomon Codes
por: Kruglik, Stanislav, et al.
Publicado: (2024)
por: Kruglik, Stanislav, et al.
Publicado: (2024)
Lower Bounds on the Sub-Packetization of Optimal-Access MSR Codes for Multiple-Node Repair
por: Wang, Lewen, et al.
Publicado: (2025)
por: Wang, Lewen, et al.
Publicado: (2025)
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
por: Singhvi, Shubhransh, et al.
Publicado: (2024)
por: Singhvi, Shubhransh, et al.
Publicado: (2024)
Column Twisted Reed-Solomon Codes as MDS Codes
por: Liu, Wei, et al.
Publicado: (2025)
por: Liu, Wei, et al.
Publicado: (2025)
New Centralized MSR Codes With Small Sub-packetization
por: Zhang, Yaqian
Publicado: (2024)
por: Zhang, Yaqian
Publicado: (2024)
Repairing Reed-Solomon Codes with Side Information
por: Dinh, Thi Xinh, et al.
Publicado: (2024)
por: Dinh, Thi Xinh, et al.
Publicado: (2024)
Repairing Reed-Solomon Codes over Prime Fields via Exponential Sums
por: Con, Roni, et al.
Publicado: (2024)
por: Con, Roni, et al.
Publicado: (2024)
Unique Decoding of Hyperderivative Reed-Solomon Codes
por: Gu, Haojie, et al.
Publicado: (2026)
por: Gu, Haojie, et al.
Publicado: (2026)
Coding Theorem for Generalized Reed-Solomon Codes
por: Zheng, Xiangping, et al.
Publicado: (2025)
por: Zheng, Xiangping, et al.
Publicado: (2025)
Hermitian Self-dual Generalized Reed-Solomon Codes
por: Zhao, Chun'e, et al.
Publicado: (2026)
por: Zhao, Chun'e, et al.
Publicado: (2026)
Optimal Two-Dimensional Reed--Solomon Codes Correcting Insertions and Deletions
por: Con, Roni, et al.
Publicado: (2023)
por: Con, Roni, et al.
Publicado: (2023)
List Decoding of Reed-Solomon Codes and Folded Reed-Solomon Codes Over Galois Ring
por: Yuan, Chen, et al.
Publicado: (2025)
por: Yuan, Chen, et al.
Publicado: (2025)
On $(\mathcal{L},\mathcal{P})$-Twisted Generalized Reed-Solomon Codes
por: Hu, Zhao, et al.
Publicado: (2025)
por: Hu, Zhao, et al.
Publicado: (2025)
Successive Cancellation List Decoding of Extended Reed-Solomon Codes
por: Ye, Xiaoqian, et al.
Publicado: (2026)
por: Ye, Xiaoqian, et al.
Publicado: (2026)
Deep Holes of Twisted Reed-Solomon Codes
por: Fang, Weijun, et al.
Publicado: (2024)
por: Fang, Weijun, et al.
Publicado: (2024)
Optimally Decoding Two-Dimensional Reed-Solomon Codes Against Deletion Errors
por: Singhvi, Shubhransh
Publicado: (2024)
por: Singhvi, Shubhransh
Publicado: (2024)
Optimal Proximity Gap for Folded Reed--Solomon Codes via Subspace Designs
por: Jeronimo, Fernando Granha, et al.
Publicado: (2026)
por: Jeronimo, Fernando Granha, et al.
Publicado: (2026)
Generalized Hyperderivative Reed-Solomon Codes
por: Can, Mahir Bilen, et al.
Publicado: (2025)
por: Can, Mahir Bilen, et al.
Publicado: (2025)
Hermitian Self-dual Twisted Generalized Reed-Solomon Codes
por: Zhao, Chun'e, et al.
Publicado: (2025)
por: Zhao, Chun'e, et al.
Publicado: (2025)
Reducing The Sub-packetization Level of Optimal-Access Cooperative MSR Codes
por: Zhang, Yaqian, et al.
Publicado: (2026)
por: Zhang, Yaqian, et al.
Publicado: (2026)
Random Reed-Solomon Codes are List Recoverable with Optimal List Size
por: Doron, Dean, et al.
Publicado: (2024)
por: Doron, Dean, et al.
Publicado: (2024)
MDS and NMDS Codes from the Extended Twisted Generalized Reed-Solomon Codes
por: Wang, Yanli, et al.
Publicado: (2026)
por: Wang, Yanli, et al.
Publicado: (2026)
Distinguishers for Skew and Linearized Reed-Solomon Codes
por: Hörmann, Felicitas, et al.
Publicado: (2026)
por: Hörmann, Felicitas, et al.
Publicado: (2026)
Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent
por: Levi, Matan, et al.
Publicado: (2024)
por: Levi, Matan, et al.
Publicado: (2024)
Explicit List-Decodable Linearized Reed-Solomon and Folded Linearized Reed-Solomon Subcodes
por: Shang, Kuo, et al.
Publicado: (2026)
por: Shang, Kuo, et al.
Publicado: (2026)
Fast Decoding of Interleaved Linearized Reed-Solomon Codes and Variants
por: Bartz, Hannes, et al.
Publicado: (2022)
por: Bartz, Hannes, et al.
Publicado: (2022)
A Fast Decoding Algorithm for Generalized Reed-Solomon Codes and Alternant Codes
por: Tang, Nianqi, et al.
Publicado: (2025)
por: Tang, Nianqi, et al.
Publicado: (2025)
Improved List Size for Folded Reed-Solomon Codes
por: Srivastava, Shashank
Publicado: (2024)
por: Srivastava, Shashank
Publicado: (2024)
Non-Reed-Solomon Type MDS Codes from Elliptic Curves
por: Wang, Puyin, et al.
Publicado: (2025)
por: Wang, Puyin, et al.
Publicado: (2025)
Calculating the I/O Cost of Linear Repair Schemes for RS Codes Evaluated on Subspaces via Exponential Sums
por: Liu, Zhongyan, et al.
Publicado: (2024)
por: Liu, Zhongyan, et al.
Publicado: (2024)
Research on the Construction of Maximum Distance Separable Codes via Arbitrary twisted Generalized Reed-Solomon Codes
por: Zhao, Chun'e, et al.
Publicado: (2024)
por: Zhao, Chun'e, et al.
Publicado: (2024)
Reconstructing Reed-Solomon Codes from Multiple Noisy Channel Outputs
por: Singhvi, Shubhransh, et al.
Publicado: (2026)
por: Singhvi, Shubhransh, et al.
Publicado: (2026)
Efficient Covering Using Reed--Solomon Codes
por: Riasat, Samin, et al.
Publicado: (2025)
por: Riasat, Samin, et al.
Publicado: (2025)
Explicit Constructions for Rack-Aware Minimum Storage Partially Cooperative Regenerating Codes
por: Zhao, Hengming, et al.
Publicado: (2025)
por: Zhao, Hengming, et al.
Publicado: (2025)
Constructions of non-Generalized Reed-Solomon MDS codes
por: Liu, Shengwei, et al.
Publicado: (2024)
por: Liu, Shengwei, et al.
Publicado: (2024)
Ejemplares similares
-
A Formula for the I/O Cost of Linear Repair Schemes and Application to Reed-Solomon Codes
por: Liu, Zhongyan, et al.
Publicado: (2024) -
A Transformation of Repairing Reed-Solomon Codes from Rack-Aware Storage Model to Homogeneous Storage Model
por: Yang, Yumeng, et al.
Publicado: (2024) -
Rack-Aware MSR Codes with Linear Field Size and Smaller Sub-Packetization for Tolerating Multiple Erasures
por: Zhao, Hengming, et al.
Publicado: (2025) -
Construction of Locally Repairable Array Codes with Optimal Repair Bandwidth under the Rack-Aware Storage Model
por: Yang, Yumeng, et al.
Publicado: (2024) -
Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach
por: Qiu, Jing, et al.
Publicado: (2026)