Constructions of Optimal Binary Locally Recoverable Codes via a General Construction of Linear Codes.
Saved in:
| Title: | Constructions of Optimal Binary Locally Recoverable Codes via a General Construction of Linear Codes. |
|---|---|
| Authors: | Luo, Gaojun1 gjluo1990@163.com, Cao, Xiwang2 xwcao@nuaa.edu.cn |
| Source: | IEEE Transactions on Communications. Aug2021, Vol. 69 Issue 8, p4987-4997. 11p. |
| Subject Terms: | *SPREAD spectrum communications, LINEAR codes, HAMMING weight |
| Abstract: | 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 alphabet-dependent bound. Using a general framework for linear codes associated to a set, we provide a new approach to constructing binary locally recoverable codes with locality 2. We turn the problem of designing optimal binary locally recoverable codes into constructing a suitable set. Several constructions of optimal binary locally recoverable codes are proposed by this new method. Finally, we propose constructions of optimal binary locally recoverable codes with locality 2 and locality parameters $(\text {r},\delta)$ by Griesmer codes. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Communications is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Business Source Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Be the first to leave a comment!