Binary Locally Repairable Codes With Minimum Distance at Least Six Based on Partial t-Spreads

被引：24

作者：

Nam, Mi-Young ^{[1
]}

Song, Hong-Yeop ^{[1
]}

机构：

[1] Yonsei Univ, Dept Elect & Elect Engn, Seoul 120749, South Korea

来源：

IEEE COMMUNICATIONS LETTERS | 2017年 / 21卷 / 08期

基金：

新加坡国家研究基金会;

关键词：

Locally repairable codes; parity-check matrix; partial t-spreads;

D O I：

10.1109/LCOMM.2017.2697424

中图分类号：

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

学科分类号：

0809 ;

摘要：

We propose a new construction for binary locally repairable codes (LRCs) based on a (partial) t-spread, which constructs an LRC with minimum distance d >= 6 and any locality r >= 2. Furthermore, we found that there are some cases in which the resulting codes are optimum in terms of the upper bound by Cadambe and Mazumdar in 2015.

引用

页码：1683 / 1686

页数：4

共 18 条

[1]

[Anonymous], 1998, OXFORD MATH MONOGR

[2]

[Anonymous], BOUNDS CONSTRUCTIONS

[3] PARTITIONS OF A VECTOR-SPACE [J].

BU, T .

DISCRETE MATHEMATICS, 1980, 31 (01) :79-83

[4]

Cadambe V, 2013, INT SYMP NETW COD

[5] Bounds on the Size of Locally Recoverable Codes [J].

Cadambe, Viveck R. ;

Mazumdar, Arya .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (11) :5787-5794

[6] The maximum size of a partial 3-spread in a finite vector space over G F(2) [J].

El-Zanati, S. ;

Jordon, H. ;

Seelinger, G. ;

Sissokho, P. ;

Spence, L. .

DESIGNS CODES AND CRYPTOGRAPHY, 2010, 54 (02) :101-107

[7] Error-Correcting Codes in Projective Space [J].

Etzion, Tuvi ;

Vardy, Alexander .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) :1165-1173

[8] 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

[9]

Grassl M., Bounds on the minimum distance of linear codes

[10]

Hao J, 2016, IEEE INT SYMP INFO, P440, DOI 10.1109/ISIT.2016.7541337

← 1 2 →