How long can optimal locally repairable codes be?
A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword symbol using only r other codeword symbols. A Singleton-type bound dictates the best possible trade-off between the dimension and distance of LRCs - an LRC attaining this trade-off is deemed optimal. Such...
Saved in:
| Main Authors: | , , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2018
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/89385 http://hdl.handle.net/10220/46213 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|