An Improved Bound for Optimal Locally Repairable Codes

被引：0

作者：

Cai, Han ^{[1
]}

Fan, Cuiling ^{[2
]}

Miao, Ying ^{[3
]}

Schwartz, Moshe ^{[1
]}

Tang, Xiaohu ^{[4
]}

机构：

[1] Ben Gurion Univ Negev, Sch Elect & Comp Engn, IL-8410501 Beer Sheva, Israel

[2] Southwest Jiaotong Univ, Sch Math, Chengdu 610031, Peoples R China

[3] Univ Tsukuba, Fac Engn Informat & Syst, Tennodai 1-1, Tsukuba, Ibaraki 3058573, Japan

[4] Southwest Jiaotong Univ, Sch Informat Sci & Technol, Chengdu 610031, Peoples R China

来源：

2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) | 2021年

关键词：

CONSTRUCTIONS;

D O I：

10.1109/ISIT45174.2021.9518040

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes is studied. An improved bound is presented by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal.

引用

页码：3379 / 3384

页数：6

共 50 条

[31] On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes
Cai, Han
Schwartz, Moshe
2020 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2020, : 571 - 576
[32] An Integer Programming-Based Bound for Locally Repairable Codes
Wang, Anyu
Zhang, Zhifang
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (10) : 5280 - 5294
[33] Locally Repairable Codes
Papailiopoulos, Dimitris S.
Dimakis, Alexandros G.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (10) : 5843 - 5855
[34] Locally Repairable Codes
Papailiopoulos, Dimitris S.
Dimakis, Alexandros G.
2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
[35] Some new constructions of optimal and almost optimal locally repairable codes
Chauhan, Varsha
Sharma, Anuradha
FINITE FIELDS AND THEIR APPLICATIONS, 2025, 101
[36] Optimal Binary Locally Repairable Codes with Joint Information Locality
Kim, Jung-Hyun
Nam, Mi-Young
Song, Hong-Yeop
2015 IEEE INFORMATION THEORY WORKSHOP - FALL (ITW), 2015, : 54 - 58
[37] Optimal (r, δ)-Locally Repairable Codes from Reed-Solomon Codes∗
Shen, Lin-Zhi
Wang, Yu-Jie
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2023, E106A (12) : 1589 - 1592
[38] On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
Cai, Han
Miao, Ying
Schwartz, Moshe
Tang, Xiaohu
IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (04) : 2402 - 2416
[39] Construction of Optimal Locally Repairable Codes Based on Latin Square
Wang E.
Wang J.
Li J.
Yang J.
Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications, 2023, 46 (05): : 8 - 14
[40] Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes
Luo, Yuan
Xing, Chaoping
Yuan, Chen
IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (02) : 1048 - 1053

← 1 2 3 4 5 →