Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for d = k+1, k+2, k+3

Vajha, Myna and Babu, Balaji Srinivasan and Kumar, P Vijay (2018) Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for d = k+1, k+2, k+3. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 2376-2380.

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

Abstract

This paper presents the construction of an explicit, optimal-access, high-rate MSR code for any (n, k, d = k + 1, k + 2, k + 3) parameters over the finite field F-Q having sub-packetization alpha = q(inverted right perpendicular)n/q(inverted left perpendicular), where q = d - k + 1 and Q = O(n). The sub-packetization of the current construction meets the lower bound proven in a recent work by Balaji et al. in 1]. To our understanding the codes presented in this paper are the first explicit constructions of MSR codes with d < (n - 1) having optimal sub-packetization, optimal access and small field size.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belong to IEEE
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/61141

Actions (login required)

View Item