Name
Abstract | ||
|---|---|---|
We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement compared with known constructions. For certain asymptotic regimes, the constructed codes have order-optimal alphabet size, asymptotically matching the known lower bound. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/TIT.2021.3120016 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Codes,Maintenance engineering,Hamming distance,Reed-Solomon codes,Linear codes,Codecs,Bandwidth | Journal | 68 |
Issue | ISSN | Citations |
1 | 0018-9448 | 6 |
PageRank | References | Authors |
0.49 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Han Cai | 1 | 92 | 7.41 |
| Ying Miao | 2 | 491 | 43.85 |
| Moshe Schwartz | 3 | 345 | 35.86 |
| Xiaohu Tang | 4 | 1294 | 121.15 |