Permanent link to this recordhttp://hdl.handle.net/10754/626676
MetadataShow full item record
AbstractWe construct balanced and sparse generator matrices for Tamo and Barg's Locally Recoverable Codes (LRCs). More specifically, for a cyclic Tamo-Barg code of length n, dimension k and locality r, we show how to deterministically construct a generator matrix where the number of nonzeros in any two columns differs by at most one, and where the weight of every row is d + r - 1, where d is the minimum distance of the code. Since LRCs are designed mainly for distributed storage systems, the results presented in this work provide a computationally balanced and efficient encoding scheme for these codes. The balanced property ensures that the computational effort exerted by any storage node is essentially the same, whilst the sparse property ensures that this effort is minimal. The work presented in this paper extends a similar result previously established for Reed-Solomon (RS) codes, where it is now known that any cyclic RS code possesses a generator matrix that is balanced as described, but is sparsest, meaning that each row has d nonzeros.
CitationHalbawi W, Duursma I, Dau H, Hassibi B (2017) Balanced and sparse Tamo-Barg codes. 2017 IEEE International Symposium on Information Theory (ISIT). Available: http://dx.doi.org/10.1109/isit.2017.8006682.
SponsorsThe work of Wael Halbawi was supported by the Qatar Foundation-Research Division. The work of Iwan Duursma was supported in part by the NSF grant CCF 1619189. The work of Hoang Dau has been supported in part by the NSF grant CCF 1526875 and the Center for Science of Information under the grant NSF 093937. The work of Babak Hassibi was supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASAs Jet Propulsion Laboratory through the President and Directors Fund, by King Abdulaziz University, and by King Abdullah University of Science and Technology.