Codes With Hierarchical Locality

Sasidharan, Birenjith and Agarwal, Gaurav Kumar and Kumar, Vijay P (2015) Codes With Hierarchical Locality. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 1257-1261.

PDF IEEE_Int_Sym_Inf_The_1257_2015.pdf - Published Version Restricted to Registered users only Download (368kB) | Request a copy

Abstract

In this paper, we study the notion of codes with hierarchical locality that is identified as another approach to local recovery from multiple erasures. The well-known class of codes with locality is said to possess hierarchical locality with a single level. In a code with two-level hierarchical locality, every symbol is protected by an inner-most local code, and another middle-level code of larger dimension containing the local code. We first consider codes with two levels of hierarchical locality, derive an upper bound on the minimum distance, and provide optimal code constructions of low field-size under certain parameter sets. Subsequently, we generalize both the bound and the constructions to hierarchical locality of arbitrary levels.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	07 Dec 2016 05:45
Last Modified:	07 Dec 2016 05:45
URI:	http://eprints.iisc.ac.in/id/eprint/55510

Actions (login required)

View Item