Codes with local regeneration

Kamath, Govinda M.; Prakash, Naveen; Lalitha, V.; Kumar, P. Vijay

doi:10.1109/isit.2013.6620498

Cited by 42 publications

(102 citation statements)

References 39 publications

Supporting

Mentioning

102

Contrasting

Order By: Relevance

“…This was re-cently further generalized for nonlinear codes [25] and several explicit constructions of locally repairable codes have been investigated (e.g. [18,24,30,37,38]). Note that locally repairable codes are related but fundamentally different from locally decodable codes [42].…”

Section: Related Workmentioning

confidence: 99%

Batch codes through dense graphs without short cycles

Rawat

Song

Dimakis

et al. 2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

Consider a large database of n data items that need to be stored using m servers. We study how to encode information so that a large number k of read requests can be performed in parallel while the rate remains constant (and ideally approaches one). This problem is equivalent to the design of multiset Batch Codes introduced by Ishai, Kushilevitz, Ostrovsky and Sahai [17].We give families of multiset batch codes with asymptotically optimal rates of the form 1 − 1/poly(k) and a number of servers m scaling polynomially in the number of read requests k. An advantage of our batch code constructions over most previously known multiset batch codes is explicit and deterministic decoding algorithms and asymptotically optimal fault tolerance.Our main technical innovation is a graph-theoretic method of designing multiset batch codes using dense bipartite graphs with no small cycles. We modify prior graph constructions of dense, high-girth graphs to obtain our batch code results. We achieve close to optimal tradeoffs between the parameters for bipartite graph based batch codes.

show abstract

Section: Related Workmentioning

confidence: 99%

Batch codes through dense graphs without short cycles

Rawat

Song

Dimakis

et al. 2015

2015 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…On the similar note, following the mechanism given in [19], scalar LRCs presented in this paper can also be used to design novel MBR-LRC.…”

Section: Discussionmentioning

confidence: 93%

“…The main idea here is to apply a regenerating code in each local group. (We note that, in a parallel and independent work, Kamath et al [19] also proposed utilizing regenerating codes to perform efficient local repairs. ).…”

Section: Repair Bandwidth Efficient Locally Repairable Codesmentioning

confidence: 99%

See 1 more Smart Citation

Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes

Rawat

Silberstein

Koyluoglu

et al. 2013

2013 Information Theory and Applications Workshop (ITA)

View full text Add to dashboard Cite

Abstract-This paper presents a new explicit construction for locally repairable codes (LRCs) for distributed storage systems. The codes possess all-symbols locality and maximal possible minimum distance, or equivalently, can tolerate the maximal number of node failures. This construction, based on maximum rank distance (MRD) Gabidulin codes, provides minimum distance optimal vector and scalar LRCs for a wide range of parameters. In addition, vector LRCs that allow for efficient local repair of failed nodes are considered. Towards this, the paper derives an upper bound on the amount of data that can be stored on DSS employing minimum distance optimal LRCs with given repair bandwidth, and presents codes which attain this bound by combining MRD and minimum storage regenerating (MSR) codes.

show abstract

“…Further aspects of regenerating codes where thoroughly studied in recent years [2,7,8,9,18,21,26]. In particular, the problem of constructing high rate MSR codes, i.e., with a constant number of parity nodes, has received a great deal of attention [4,22,24,29,30].…”

Section: Previous Workmentioning

confidence: 99%

Asymptotically Optimal Regenerating Codes Over Any Field

Raviv

2018

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

The study of regenerating codes has advanced tremendously in recent years. However, most known constructions require large field size, and hence may be hard to implement in practice. By using notions from the theory of extension fields, we obtain two explicit constructions of regenerating codes. These codes approach the cut-set bound as the reconstruction degree increases, and may be realized over any given field if the file size is large enough. Since distributed storage systems are the main purpose of regenerating codes, this file size restriction is trivially satisfied in most conceivable scenarios. The first construction attains the cut-set bound at the MBR point asymptotically for all parameters, whereas the second one attains the cut-set bound at the MSR point asymptotically for low-rate parameters.

show abstract

Codes with local regeneration

Cited by 42 publications

References 39 publications

Batch codes through dense graphs without short cycles

Batch codes through dense graphs without short cycles

Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes

Asymptotically Optimal Regenerating Codes Over Any Field

Contact Info

Product

Resources

About