Optimal Binary Locally Repairable Codes via Anticodes
classification
💻 cs.IT
math.IT
keywords
binarycodesoptimalanticodesboundconstructionlocallylrcs
read the original abstract
This paper presents a construction for several families of optimal binary locally repairable codes (LRCs) with small locality (2 and 3). This construction is based on various anticodes. It provides binary LRCs which attain the Cadambe-Mazumdar bound. Moreover, most of these codes are optimal with respect to the Griesmer bound.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.