Abstract
New constructions of binary and ternary locally repairable codes (LRCs) using cyclic codes and their concatenation are proposed. The proposed binary LRCs with d=4 and some r and with d≥5 and some n are shown to be optimal in terms of the upper bounds. In addition, the similar method of the binary case is applied to construct the ternary LRCs with good parameters.
| Original language | English |
|---|---|
| Article number | 8116634 |
| Pages (from-to) | 228-231 |
| Number of pages | 4 |
| Journal | IEEE Communications Letters |
| Volume | 22 |
| Issue number | 2 |
| DOIs | |
| State | Published - 2018.02 |
Keywords
- Cyclic codes
- distributed storage systems (DSSs)
- locally repairable codes (LRCs)
Fingerprint
Dive into the research topics of 'New Constructions of Binary and Ternary Locally Repairable Codes Using Cyclic Codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver