Codes with Combined Locality and Regeneration Having Optimal Rate, d(min) and Linear Field Size

Krishnan, M Nikhil and Narayanan, Anantha R and Kumar, P Vijay (2018) Codes with Combined Locality and Regeneration Having Optimal Rate, d(min) and Linear Field Size. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 1196-1200.

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

Abstract

In this paper, we study vector codes with all-symbol locality, where the local code is either a Minimum Bandwidth Regenerating (MBR) code or a Minimum Storage Regenerating (MSR) code. In the first part, we present vector codes with all-symbol MBR locality, for all parameters, that have both optimal minimum-distance and optimal rate. These codes combine ideas from two popular codes in the distributed storage literature; Product-Matrix codes and Tamo-Barg codes. In the second part which deals with codes having all-symbol MSR locality, we follow a Pairwise Coupling Transform-based approach to arrive at optimal minimum-distance and optimal rate, for a range of parameters. All the code constructions presented in this paper have a low field-size that grows linearly with the code-length n.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belong to IEEE
Keywords:	Regenerating codes; codes with locality; vector codes
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	24 Nov 2018 14:29
Last Modified:	24 Nov 2018 14:29
URI:	http://eprints.iisc.ac.in/id/eprint/61133

Actions (login required)

View Item