Binary Codes with Locality for Four Erasures
Information Theory
2016-11-04 v3 math.IT
Abstract
In this paper, codes with locality for four erasures are considered. An upper bound on the rate of codes with locality with sequential recovery from four erasures is derived. The rate bound derived here is field independent. An optimal construction for binary codes meeting this rate bound is also provided. The construction is based on regular graphs of girth and employs the sequential approach of locally recovering from multiple erasures. An extension of this construction that generates codes which can sequentially recover from five erasures is also presented.
Keywords
Cite
@article{arxiv.1607.02817,
title = {Binary Codes with Locality for Four Erasures},
author = {S. B. Balaji and K. P. Prasanth and P. Vijay Kumar},
journal= {arXiv preprint arXiv:1607.02817},
year = {2016}
}
Comments
5 pages, 2 figures