On the locality of codeword symbols in non-linear codes

Michael Forbes; Sergey Yekhanin

doi:10.1016/j.disc.2014.01.016

On the locality of codeword symbols in non-linear codes

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Pages (from-to)	78-84
Number of pages	7
Journal	Discrete Mathematics
Volume	324
Issue number	1
DOIs	https://doi.org/10.1016/j.disc.2014.01.016
State	Published - Jun 6 2014
Externally published	Yes

Keywords

Error-correcting codes
Locality
Non-linear codes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Online availability

10.1016/j.disc.2014.01.016

Library availability

Discover UIUC Full Text

Cite this

@article{208baa326a7a4396971dc92d2ca3a7be,

title = "On the locality of codeword symbols in non-linear codes",

abstract = "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.",

keywords = "Error-correcting codes, Locality, Non-linear codes",

author = "Michael Forbes and Sergey Yekhanin",

year = "2014",

month = jun,

day = "6",

doi = "10.1016/j.disc.2014.01.016",

language = "English (US)",

volume = "324",

pages = "78--84",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - On the locality of codeword symbols in non-linear codes

AU - Forbes, Michael

AU - Yekhanin, Sergey

PY - 2014/6/6

Y1 - 2014/6/6

N2 - 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.

AB - 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.

KW - Error-correcting codes

KW - Locality

KW - Non-linear codes

UR - http://www.scopus.com/inward/record.url?scp=84897677500&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84897677500&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2014.01.016

DO - 10.1016/j.disc.2014.01.016

M3 - Article

AN - SCOPUS:84897677500

SN - 0012-365X

VL - 324

SP - 78

EP - 84

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1

ER -

On the locality of codeword symbols in non-linear codes

Abstract

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this