An upper bound on the size of locally recoverable codes

Viveck Cadambe, Arya Mazumdar

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

49 Scopus citations

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

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