Name
Abstract | ||
|---|---|---|
Like classical block codes, a locally repairable code also obeys the Singleton-type bound (we call a locally repairable code optimal if it achieves the Singleton-type bound). In the breakthrough work of Tamo and Barg, several classes of optimal locally repairable codes were constructed via subcodes of Reed-Solomon codes. Thus, the lengths of the codes given by Tamo and Barg are upper bounded by th... |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TIT.2018.2854717 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Reed-Solomon codes,Linear codes,Error correction codes,Parity check codes,Polynomials | Discrete mathematics,Combinatorics,Locality,Polynomial,Computer science,Block code,Elliptic curve,Bounded function,Alphabet | Journal |
Volume | Issue | ISSN |
65 | 2 | 0018-9448 |
Citations | PageRank | References |
10 | 0.52 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuan Luo | 1 | 325 | 45.06 |
| Chaoping Xing | 2 | 916 | 110.47 |
| Chen Yuan | 3 | 27 | 12.30 |