Uniform Minors in Maximally Recoverable Codes

被引：3

作者：

Grezet, Matthias ^{[1
]}

Westerback, Thomas ^{[2
]}

Freij-Hollanti, Ragnar ^{[1
]}

Hollanti, Camilla ^{[1
]}

机构：

[1] Aalto Univ, Dept Math & Syst Anal, Aalto 00076, Finland

[2] Malardanen Univ, Div Appl Math, UKK, S-72123 Vasteras, Sweden

来源：

IEEE COMMUNICATIONS LETTERS | 2019年 / 23卷 / 08期

基金：

芬兰科学院;

关键词：

Distributed storage; locally repairable codes; maximally recoverable codes; uniform minors; field size;

D O I：

10.1109/LCOMM.2019.2921540

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

In this letter, locally recoverable codes with maximal recoverability are studied with a focus on identifying the MDS codes resulting from puncturing and shortening. By using matroid theory and the relation between MDS codes and uniform minors, the list of all the possible uniform minors is derived. This list is used to improve the known non-asymptotic lower bound on the required field size of a maximally recoverable code.

引用

页码：1297 / 1300

页数：4

共 50 条

[1] On Partial Maximally-Recoverable and Maximally-Recoverable Codes
Balaji, S. B.
Kumar, P. Vijay
[J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 1881 - 1885
[2] A construction of maximally recoverable codes
Alexander Barg
Zitan Chen
Itzhak Tamo
[J]. Designs, Codes and Cryptography, 2022, 90 : 939 - 945
[3] A construction of maximally recoverable codes
Barg, Alexander
Chen, Zitan
Tamo, Itzhak
[J]. DESIGNS CODES AND CRYPTOGRAPHY, 2022, 90 (04) : 939 - 945
[4] Maximally Recoverable Codes: the Bounded Case
Gandikota, Venkata
Grigorescu, Elena
Thomas, Clayton
Zhu, Minshen
[J]. 2017 55TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2017, : 1115 - 1122
[5] Explicit Maximally Recoverable Codes With Locality
Gopalan, Parikshit
Huang, Cheng
Jenkins, Bob
Yekhanin, Sergey
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (09) : 5245 - 5256
[6] Maximally Recoverable Codes with Hierarchical Locality
Nair, Aaditya M.
Lalitha, V.
[J]. 2019 25TH NATIONAL CONFERENCE ON COMMUNICATIONS (NCC), 2019,
[7] On Maximally Recoverable Codes for Product Topologies
Shivakrishna, D.
Rameshwar, V. Arvind
Lalitha, V.
Sasidharan, Birenjith
[J]. 2018 TWENTY FOURTH NATIONAL CONFERENCE ON COMMUNICATIONS (NCC), 2018,
[8] Properties of Maximally Recoverable Product Codes and Higher Order MDS Codes
Shivakrishna, D.
Lalitha, V
[J]. 2022 NATIONAL CONFERENCE ON COMMUNICATIONS (NCC), 2022, : 233 - 238
[9] Maximally Recoverable Codes for Grid-like Topologies
Gopalan, Parikshit
Hu, Guangda
Kopparty, Swastik
Saraf, Shubhangi
Wang, Carol
Yekhanin, Sergey
[J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 2092 - 2108
[10] Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes
Brakensiek, Joshua
Gopi, Sivakanth
Makam, Visu
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (11) : 7125 - 7140

← 1 2 3 4 5 →