TU3.R3.1

New EVENODD+ Codes with More Flexible Parameters and Lower Complexity

Panyu Zhu, Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, China; Jingjie Lv, School of Electrical Engineering & Intelligentization, Dongguan University of Technology, China; Yunghsiang Sam Han, Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, China; Linqi Song, Department of Computer Science, City University of Hong Kong, China; Hanxu Hou, School of Electrical Engineering & Intelligentization, Dongguan University of Technology, China
Session:
Codes for Storage 3
Track:
2: Modern Coding Theory
Location:
Ypsilon IV-V-VI
Presentation Time:
Tue, 9 Jul, 14:25 - 14:45
Session Chair:
Sihem Mesnager, Paris 8
Abstract
EVENODD+ codes are binary maximum distance separable (MDS) array codes for correcting double disk failures in RAID-6 with asymptotically optimal encoding/decoding/update complexities. However, the number of bits stored in each disk of EVENODD+ codes should be an odd number minus one. In this paper, we present a new construction of EVENODD+ codes that have more flexible parameters. The number of bits stored in each disk of our codes is an odd minus one times any positive integer. Moreover, our codes not only have asymptotically optimal encoding/decoding/update complexities but also have lower encoding/decoding/update complexities than the existing EVENODD+ codes.
Session TU3.R3
TU3.R3.1: New EVENODD+ Codes with More Flexible Parameters and Lower Complexity
Panyu Zhu, Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, China; Jingjie Lv, School of Electrical Engineering & Intelligentization, Dongguan University of Technology, China; Yunghsiang Sam Han, Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, China; Linqi Song, Department of Computer Science, City University of Hong Kong, China; Hanxu Hou, School of Electrical Engineering & Intelligentization, Dongguan University of Technology, China
TU3.R3.2: Upper Bound on Coding Rate over Resistive Random-Access Memory Channel under Arbitrary Input Distribution
Guanghui Song, Qi Cao, Ying Li, Xidian University, China; Xuan He, Southwest Jiaotong University, China; Kui Cai, Singapore University of Technology and Design, Singapore
TU3.R3.3: Constructing $(h,k+1)$ cooperative MSR codes with sub-packetization $(h+1)2^{\lceil n/2 \rceil}$
Zihao Zhang, Guodong Li, Sihuang Hu, Shandong University, China
TU3.R3.4: Error-Resilient Weakly Constrained Coding via Row-by-Row Coding
Prachi Mishra, Navin Kashyap, Indian Institute of Science, India
Resources
View Manuscript