Back to Search
Start Over
Asymptotically Optimal Regenerating Codes Over Any Field.
- Source :
- IEEE Transactions on Information Theory; Nov2018, Vol. 64 Issue 11, p7178-7187, 10p
- Publication Year :
- 2018
-
Abstract
- The study of regenerating codes has advanced tremendously in recent years. However, most known constructions require large field size and, hence, may be hard to implement in practice. By restructuring a code construction by Rashmi et al., we obtain two explicit families regenerating codes. These codes approach the cut-set bound as the reconstruction degree increases and may be realized over any given finite field if the file size is large enough. Essentially, these codes constitute a constructive proof that the cut-set bound does not imply a field size restriction, unlike some known bounds for ordinary linear codes. The first construction attains the cut-set bound at the MBR point asymptotically for all parameters, whereas the second one attains the cut-set bound at the MSR point asymptotically for low-rate parameters. Even though these codes require a large file size, this restriction is trivially satisfied in most conceivable distributed storage scenarios, that are the prominent motivation for regenerating codes. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 64
- Issue :
- 11
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 132546132
- Full Text :
- https://doi.org/10.1109/TIT.2018.2815537