On the Maximal Code Length of Optimal Linear LRC Codes with Availability

被引：1
作者：
Kruglik, Stanislav [1 ]
Nazirkhanova, Kamilla
Frolov, Alexey
机构：
[1] Skolkovo Inst Sci & Technol, Moscow, Russia
来源：
FIFTH INTERNATIONAL CONFERENCE ON ENGINEERING AND TELECOMMUNICATION (ENT-MIPT 2018) | 2018年
关键词：
locality; information theory; distributed storage; network coding; index coding; LOCALITY; BOUNDS;
D O I：
10.1109/EnT-MIPT.2018.00018
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A code over finite alphabet is said to be locally recoverable (LRC) if each code symbol is function of small number of other symbols forming the recovering set [1], [2], [3], [4], [5]. These codes were first proposed in [1] and immediate become popular due to obvious applications in distributed and cloud storage systems. Natural generalization of LRC codes is LRC codes with availability in which each code symbol has more than one disjoint recovering set. A LRC codes with availability is said to be optimal if its minimum distance achieves the Singleton-like bound developed by Kruglik et. al in this paper we study the maximum code length of q-ary optimal LRC with availability and then derive some structural properties.
引用
收藏
页码：54 / 57
页数：4
相关论文
共 19 条
[1]   Upper bounds on the rate of LDPC codes as a function of minimum distance [J].
Ben-Haim, Y ;
Litsyn, S .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (05) :2092-2100
[2]   Bounds on the Size of Locally Recoverable Codes [J].
Cadambe, Viveck R. ;
Mazumdar, Arya .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (11) :5787-5794
[3]   Codes of Small Defect [J].
Faldum A. ;
Willems W. .
Designs, Codes and Cryptography, 1997, 10 (3) :341-350
[4]   Explicit Maximally Recoverable Codes With Locality [J].
Gopalan, Parikshit ;
Huang, Cheng ;
Jenkins, Bob ;
Yekhanin, Sergey .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (09) :5245-5256
[5]   On the Locality of Codeword Symbols [J].
Gopalan, Parikshit ;
Huang, Cheng ;
Simitci, Huseyin ;
Yekhanin, Sergey .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (11) :6925-6934
[6]  
Hao J, 2018, IEEE INT SYMP INFO, P1326, DOI 10.1109/ISIT.2018.8437466
[7]  
Huang PF, 2015, IEEE INT SYMP INFO, P1871, DOI 10.1109/ISIT.2015.7282780
[8]  
Kruglik S, 2018, IEEE INT SYMP INFO, P1336, DOI 10.1109/ISIT.2018.8437738
[9]  
Kruglik S, 2017, INFO THEOR WORKSH, P26, DOI 10.1109/ITW.2017.8277989
[10]  
Kruglik S, 2017, IEEE INT SYMP INFO, P1023, DOI 10.1109/ISIT.2017.8006683
12