Constructions of optimal binary locally recoverable codes via a general construction of linear codes
Locally recoverable codes play a crucial role in distributed storage systems. Many studies have only focused on the constructions of optimal locally recoverable codes with regard to the Singleton bound. The aim of this paper is to construct optimal binary locally recoverable codes meeting the al...
Main Authors: | Luo, Gaojun, Cao, Xiwang |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Journal Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/150945 |
Similar Items
-
Constructions of maximally recoverable Local Reconstruction Codes via function fields
by: Guruswami, Venkatesan, et al.
Published: (2020) -
Three new constructions of optimal linear codes with few weights
by: Cheng, Yingjie, et al.
Published: (2024) -
A new family of EAQMDS codes constructed from constacyclic codes
by: Chen, Xiaojing, et al.
Published: (2022) -
Linear locally recoverable codes with locality r=1
by: Teo, Samuel Tien Ho
Published: (2017) -
Application of optimal p-ary linear codes to alphabet-optimal locally repairable codes
by: Luo, Gaojun, et al.
Published: (2022)