On the locality of codeword symbols in non-linear codes

被引：41

作者：

Forbes, Michael ^{[1
]}

Yekhanin, Sergey ^{[2
]}

机构：

[1] MIT, Cambridge, MA 02139 USA

[2] Microsoft Res, Redmond, WA USA

来源：

DISCRETE MATHEMATICS | 2014年 / 324卷

关键词：

Error-correcting codes; Non-linear codes; Locality;

D O I：

10.1016/j.disc.2014.01.016

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Coordinate i of an error-correcting code has locality r if its value is determined by some r other coordinates. Recently an optimal trade-off between information locality of linear codes, code distance, and redundancy has been obtained. Furthermore, for linear codes meeting this trade-off, structure theorems were derived. In this work we generalize the trade-off and structure theorems to non-linear codes. (C) 2014 Elsevier B.V.All rights reserved.

引用

页码：78 / 84

页数：7

共 6 条

[1]

Chen Min, 2007, Proceedings of the 4th IEEE-EMBS International Summer School and Symposium on Medical Devices and Biosensors (ISSS-MDBS 2007), P79

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

[3]

Huang C., 2012, P 2012 USENIX C ANN, P2

[4]

Papailiopoulos D. S., 2012, Proceedings of the 2012 IEEE International Symposium on Information Theory - ISIT, P2771, DOI 10.1109/ISIT.2012.6284027

[5] XORing Elephants: Novel Erasure Codes for Big Data [J].

Sathiamoorthy, Maheswaran ;

Asteris, Megasthenis ;

Papailiopoulos, Dimitris ;

Dimakis, Alexandros G. ;

Vadali, Ramkumar ;

Chen, Scott ;

Borthakur, Dhruba .

PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (05) :325-336

[6] Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound [J].

Xing, CP .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (07) :1653-1657

← 1 →