ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Binary Codes with Locality for Multiple Erasures Having Short Block Length

Balaji, SB and Prasanth, KP and Kumar, Vijay P (2016) Binary Codes with Locality for Multiple Erasures Having Short Block Length. In: IEEE International Symposium on Information Theory (ISIT), JUL 10-15, 2016, Barcelona, SPAIN, pp. 655-659.

[img] PDF
IEEE_Int_Sym_Inf_The_655_2016.pdf - Published Version
Restricted to Registered users only

Download (372kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/ISIT.2016.7541380


This paper considers linear, binary codes having locality parameter r, that are capable of recovering from t >= 2 erasures and which additionally, possess short block length. Both sequential and parallel (through orthogonal parity checks) recovery are considered. In the case of sequential repair, the results include (a) extending and characterizing minimum-block-length constructions for t 2, (b) providing improved bounds on block length fort 3 as well as a general construction for t = 3 having short block length, (c) providing high-rate constructions for (r 2, t epsilon {4, 5,6, 7}) and (d) providing short-block-length constructions for general (r,t). In the case of parallel repair, minimum-block-length constructions are characterized whenever t backslash(r(2) + r) and examples examined.

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: 09 Feb 2017 09:11
Last Modified: 25 Feb 2019 08:45
URI: http://eprints.iisc.ac.in/id/eprint/56194

Actions (login required)

View Item View Item