Small-d MSR Codes With Optimal Access, Optimal Sub-Packetization, and Linear Field Size

被引：5

作者：

Vajha, Myna ^{[1
]}

Balaji, S. B. ^{[2
]}

Kumar, P. Vijay ^{[3
]}

机构：

[1] Qualcomm, Bengaluru 560056, India

[2] NXP, Bengaluru 560045, India

[3] Indian Inst Sci Bengaluru, Dept Elect Commun Engn, Bengaluru 560012, India

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2023年 / 69卷 / 07期

关键词：

Coding theory; distributed storage; regenerating codes; minimum storage regenerating (MSR) codes; optimal access repair; Small-d codes; optimal sub-packetization level codes; MDS CODES; DISTRIBUTED STORAGE; REGENERATING CODES; OPTIMAL REPAIR;

D O I：

10.1109/TIT.2023.3250458

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents an explicit construction of a class of optimal-access, minimum storage regenerating (MSR) codes, for small values of the number d of helper nodes. The construction is valid for any parameter set (n, k, d) with d. {k + 1, k + 2, k + 3} and employs a finite field Fq of size q = O(n). We will refer to the constructed codes as Small- d MSR codes. The sub-packetization level a is given by a = s. ns., where s = d-k+ 1. By an earlier result on the sub-packetization level for optimal-access MSR codes, this is the smallest value possible.

引用

页码：4303 / 4332

页数：30

共 50 条

[21] Building Capacity-Achieving PIR Schemes with Optimal Sub-Packetization over Small Fields
Xu, Jingke
Zhang, Zhifang
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 1749 - 1753
[22] An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and d < (n-1)
Sasidharan, Birenjith
Vajha, Myna
Kumar, P. Vijay
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 2048 - 2052
[23] A New Cooperative Repair Scheme With k+1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization
Liu, Yajuan
Cai, Han
Tang, Xiaohu
IEEE TRANSACTIONS ON INFORMATION THEORY, 2023, 69 (05) : 2820 - 2829
[24] Piggybacking plus Codes: MDS Array Codes with Linear Sub-Packetization to Achieve Lower Repair Bandwidth
Shi, Hao
Jiang, Zhengyi
Huang, Zhongyi
Bai, Bo
Zhang, Gong
Hou, Hanxu
IEEE CONFERENCE ON GLOBAL COMMUNICATIONS, GLOBECOM, 2023, : 7351 - 7356
[25] Multi-access Coded Caching Scheme with Linear Sub-packetization using PDAs
Sasi, Shanuja
Rajan, B. Sundar
2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 861 - 866
[26] Multi-Access Coded Caching Scheme With Linear Sub-Packetization Using PDAs
Sasi, Shanuja
Rajan, B. Sundar
IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (12) : 7974 - 7985
[27] An Explicit Construction of Systematic MDS Codes with Small Sub-packetization for All-Node Repair
Kralevska, Katina
Gligoroski, Danilo
2018 16TH IEEE INT CONF ON DEPENDABLE, AUTONOM AND SECURE COMP, 16TH IEEE INT CONF ON PERVAS INTELLIGENCE AND COMP, 4TH IEEE INT CONF ON BIG DATA INTELLIGENCE AND COMP, 3RD IEEE CYBER SCI AND TECHNOL CONGRESS (DASC/PICOM/DATACOM/CYBERSCITECH), 2018, : 1080 - 1084
[28] Rack-aware MSR codes with optimal access
Chen, Zitan
2022 IEEE INFORMATION THEORY WORKSHOP (ITW), 2022, : 19 - 24
[29] Minimum Storage Rack-Aware Regenerating Codes with Exact Repair and Small Sub-Packetization
Hou, Hanxu
Lee, Patrick P. C.
Han, Yunghsiang S.
2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 554 - 559
[30] A Coded Caching Scheme with Linear Sub-packetization and its Application to Multi-Access Coded Caching
Mahesh, Anjana Ambika
Rajan, B. Sundar
2020 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,

← 1 2 3 4 5 →