Name
Abstract | ||
|---|---|---|
A family of distance-optimal LRC codes from certain subcodes of $q$-ary Reed-Solomon codes, proposed by I.~Tamo and A.~Barg in 2014, assumes that the code length $n$ is a multiple of $r+1.$ By shortening codes from this family, we show that it is possible to lift this assumption, still obtaining distance-optimal codes. |
Year | Venue | Field |
|---|---|---|
2018 | arXiv: Information Theory | Discrete mathematics,Lift (force),Multiple,Mathematics |
DocType | Volume | Citations |
Journal | abs/1802.00157 | 5 |
PageRank | References | Authors |
0.48 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Oleg Kolosov | 1 | 5 | 0.82 |
| Alexander Barg | 2 | 65 | 6.40 |
| Itzhak Tamo | 3 | 548 | 36.05 |
| Gala Yadgar | 4 | 127 | 9.44 |