HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Optimal Linear and Cyclic Locally Repairable Codes over Small Fields

Abstract : We consider locally repairable codes over small fields and propose constructions of optimal cyclic and linear codes in terms of the dimension for a given distance and length. Four new constructions of optimal linear codes over small fields with locality properties are developed. The first two approaches give binary cyclic codes with locality two. While the first construction has availability one, the second binary code is characterized by multiple available repair sets based on a binary Simplex code. The third approach extends the first one to q-ary cyclic codes including (binary) extension fields, where the locality property is determined by the properties of a shortened first-order Reed-Muller code. Non-cyclic optimal binary linear codes with locality greater than two are obtained by the fourth construction.
Complete list of metadata

Contributor : Alexander Zeh Connect in order to contact the contributor
Submitted on : Wednesday, February 18, 2015 - 8:35:01 AM
Last modification on : Thursday, January 6, 2022 - 2:50:02 PM
Long-term archiving on: : Tuesday, May 19, 2015 - 10:11:38 AM


Files produced by the author(s)


  • HAL Id : hal-01117826, version 1
  • ARXIV : 1502.06809



Alexander Zeh, Eitan Yaakobi. Optimal Linear and Cyclic Locally Repairable Codes over Small Fields. IEEE Information Theory Workshop (ITW) 2015, Apr 2015, Jerusalem, Israel. ⟨hal-01117826⟩



Record views


Files downloads