Name
Abstract | ||
|---|---|---|
Being part of distributed storage systems, locally repairable codes (LRCs) have drawn great attention in the past years. Inspired by a recent construction of optimal LRCs-based on cyclic codes, constacyclic LRCs are studied in this letter. Specifically, a family of optimal constacyclic
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(r,\delta)_{q}$ </tex-math></inline-formula>
-LRCs with unbounded length and minimum distance
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\delta +2\epsilon $ </tex-math></inline-formula>
is constructed, where
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$1\leq \epsilon \leq \lfloor ({\delta }/2)\rfloor $ </tex-math></inline-formula>
. A new optimal cyclic
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(r,\delta)_{q}$ </tex-math></inline-formula>
-LRC with unbounded length and minimum distance
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$2\delta $ </tex-math></inline-formula>
is also presented. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/LCOMM.2018.2884930 | IEEE Communications Letters |
Keywords | Field | DocType |
Sun,Indexes,Maintenance engineering,Mathematics,Reliability theory,Scholarships | Discrete mathematics,Computer science,Computer network,Reliability theory | Journal |
Volume | Issue | ISSN |
23 | 2 | 1089-7798 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhonghua Sun | 1 | 75 | 26.21 |
| Shixin Zhu | 2 | 216 | 37.61 |
| Liqi Wang | 3 | 23 | 4.72 |