Local Codes with Addition Based Repair
Information Theory
2015-06-09 v1 math.IT
Abstract
We consider the complexities of repair algorithms for locally repairable codes and propose a class of codes that repair single node failures using addition operations only, or codes with addition based repair. We construct two families of codes with addition based repair. The first family attains distance one less than the Singleton-like upper bound, while the second family attains the Singleton-like upper bound.
Keywords
Cite
@article{arxiv.1506.02349,
title = {Local Codes with Addition Based Repair},
author = {Han Mao Kiah and Son Hoang Dau and Wentu Song and Chau Yuen},
journal= {arXiv preprint arXiv:1506.02349},
year = {2015}
}