We propose a new construction for binary locally repairable codes (LRCs) based on a (partial) $t$-spread, which constructs an LRC with minimum distance ≥and any locality geq . Furthermore, we found that there are some cases in which the resulting codes are optimum in terms of the upper bound by Cadambe and Mazumdar in 2015.
Bibliographical notePublisher Copyright:
© 2017 IEEE.
All Science Journal Classification (ASJC) codes
- Modelling and Simulation
- Computer Science Applications
- Electrical and Electronic Engineering