Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes
We consider linear cyclic codes with the locality property or locally recoverable codes (LRC codes). A family of LRC codes that generalises the classical construction of Reed-Solomon codes was constructed in a recent paper by Tamo and Barg (IEEE Transactions on Information Theory, No. 8, 2014). In this paper, we …