Optimal Binary Locally Repairable Codes via Anticodes

2015/01/28 by Silberstein, Natalia, Zeh, Alexander
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1501.07114

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.

Related

• Optimal binary linear locally repairable codes with disjoint repair groups
• Constructions of Binary Optimal Locally Repairable Codes via Intersection Subspaces
• Bounds and Constructions for Linear Locally Repairable Codes over Binary Fields
• On Optimal Ternary Locally Repairable Codes
• Bounds and Constructions of Locally Repairable Codes: Parity-check Matrix Approach