An upper bound on the size of locally recoverable codes

Viveck Cadambe, Arya Mazumdar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

42 Citations (Scopus)

Abstract

In a locally recoverable or repairable code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage node as possible. In this paper, we bound the minimum distance of a code in terms of of its length, size and locality. Unlike previous bounds, our bound follows from a significantly simple analysis and depends on the size of the alphabet being used.

Original languageEnglish (US)
Title of host publication2013 International Symposium on Network Coding, NetCod 2013
DOIs
StatePublished - Sep 9 2013
Event2013 International Symposium on Network Coding, NetCod 2013 - Calgary, AB, Canada
Duration: Jun 7 2013Jun 9 2013

Publication series

Name2013 International Symposium on Network Coding, NetCod 2013

Other

Other2013 International Symposium on Network Coding, NetCod 2013
CountryCanada
CityCalgary, AB
Period6/7/136/9/13

Fingerprint

Repair

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software

Cite this

Cadambe, V., & Mazumdar, A. (2013). An upper bound on the size of locally recoverable codes. In 2013 International Symposium on Network Coding, NetCod 2013 [6570829] (2013 International Symposium on Network Coding, NetCod 2013). https://doi.org/10.1109/NetCod.2013.6570829
Cadambe, Viveck ; Mazumdar, Arya. / An upper bound on the size of locally recoverable codes. 2013 International Symposium on Network Coding, NetCod 2013. 2013. (2013 International Symposium on Network Coding, NetCod 2013).
@inproceedings{8e9848456c9e4a909d22d216e149a8d8,
title = "An upper bound on the size of locally recoverable codes",
abstract = "In a locally recoverable or repairable code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage node as possible. In this paper, we bound the minimum distance of a code in terms of of its length, size and locality. Unlike previous bounds, our bound follows from a significantly simple analysis and depends on the size of the alphabet being used.",
author = "Viveck Cadambe and Arya Mazumdar",
year = "2013",
month = "9",
day = "9",
doi = "10.1109/NetCod.2013.6570829",
language = "English (US)",
isbn = "9781479908233",
series = "2013 International Symposium on Network Coding, NetCod 2013",
booktitle = "2013 International Symposium on Network Coding, NetCod 2013",

}

Cadambe, V & Mazumdar, A 2013, An upper bound on the size of locally recoverable codes. in 2013 International Symposium on Network Coding, NetCod 2013., 6570829, 2013 International Symposium on Network Coding, NetCod 2013, 2013 International Symposium on Network Coding, NetCod 2013, Calgary, AB, Canada, 6/7/13. https://doi.org/10.1109/NetCod.2013.6570829

An upper bound on the size of locally recoverable codes. / Cadambe, Viveck; Mazumdar, Arya.

2013 International Symposium on Network Coding, NetCod 2013. 2013. 6570829 (2013 International Symposium on Network Coding, NetCod 2013).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An upper bound on the size of locally recoverable codes

AU - Cadambe, Viveck

AU - Mazumdar, Arya

PY - 2013/9/9

Y1 - 2013/9/9

N2 - In a locally recoverable or repairable code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage node as possible. In this paper, we bound the minimum distance of a code in terms of of its length, size and locality. Unlike previous bounds, our bound follows from a significantly simple analysis and depends on the size of the alphabet being used.

AB - In a locally recoverable or repairable code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. The notion of local recoverability is important in the area of distributed storage where a most frequent error-event is a single storage node failure (erasure). A common objective is to repair the node by downloading data from as few other storage node as possible. In this paper, we bound the minimum distance of a code in terms of of its length, size and locality. Unlike previous bounds, our bound follows from a significantly simple analysis and depends on the size of the alphabet being used.

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

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

U2 - 10.1109/NetCod.2013.6570829

DO - 10.1109/NetCod.2013.6570829

M3 - Conference contribution

AN - SCOPUS:84883341152

SN - 9781479908233

T3 - 2013 International Symposium on Network Coding, NetCod 2013

BT - 2013 International Symposium on Network Coding, NetCod 2013

ER -

Cadambe V, Mazumdar A. An upper bound on the size of locally recoverable codes. In 2013 International Symposium on Network Coding, NetCod 2013. 2013. 6570829. (2013 International Symposium on Network Coding, NetCod 2013). https://doi.org/10.1109/NetCod.2013.6570829