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 条

[31] Explicit Constructions of High-Rate MSR Codes With Optimal Access Property Over Small Finite Fields
Liu, Yi
Li, Jie
Tang, Xiaohu
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (10) : 4405 - 4413
[32] Codes with Combined Locality and Regeneration Having Optimal Rate, dmin and Linear Field Size
Krishnan, M. Nikhil
Narayanan, Anantha R.
Kumar, P. Vijay
2018 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2018, : 1196 - 1200
[33] Optimal Binary Switch Codes with Small Query Size
Wang, Zhiying
Kiah, Han Mao
Cassuto, Yuval
2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 636 - 640
[34] Optimal Linear Codes Over the Field of Order 7
Nomura, Keita
Maruta, Tatsuya
PROCEEDINGS OF THE 2020 SEVENTEENTH INTERNATIONAL WORKSHOP ON ALGEBRAIC AND COMBINATORIAL CODING THEORY ALGEBRAIC AND COMBINATORIAL CODING THEORY (ACCT 2020): PROCEEDINGS OF THE SEVENTEENTH INTERNATIONAL WORKSHOP ON ALGEBRAIC AND COMBINATORIAL CODING THEORY ACCT 2020, 2020, : 113 - 117
[35] General Sub-Packetized Access-Optimal Regenerating Codes
Kralevska, Katina
Gligoroski, Danilo
Overby, Harald
IEEE COMMUNICATIONS LETTERS, 2016, 20 (07) : 1281 - 1284
[36] Classification of Some Optimal Ternary Linear Codes of Small Length
Marijn van Eupen
Petr Lisonvek
Designs, Codes and Cryptography, 1997, 10 (1) : 63 - 84
[37] Access-optimal Linear MDS Convertible Codes for All Parameters
Maturana, Francisco
Mukka, V. S. Chaitanya
Rashmi, K., V
2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 577 - 582
[38] Optimal Possibly Nonlinear 3-PIR Codes of Small Size
Hollmann, Henk D. L.
Luhaaar, Urmas
ARITHMETIC OF FINITE FIELDS, WAIFI 2022, 2023, 13638 : 159 - 168
[39] Optimal Linear and Cyclic Locally Repairable Codes over Small Fields
Zeh, Alexander
Yaakobi, Eitan
2015 IEEE INFORMATION THEORY WORKSHOP (ITW), 2015,
[40] Rate Optimal Binary Linear Locally Repairable Codes with Small Availability
Kadhe, Swanand
Calderbank, Robert
2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2017, : 166 - 170

← 1 2 3 4 5 →