Optimal Locally Repairable Codes: An Improved Bound and Constructions
Optimal Locally Repairable Codes: An Improved Bound and Constructions
复制标题
最优局部可修复代码：改进的边界和构造
DOI：
10.1109/tit.2022.3161613
复制
发表时间：
2020-11
影响因子：
2.5
通讯作者：
Xiaohu Tang
中科院分区：
文献类型：
--
作者：
Han Cai;Cuiling Fan;Ying Miao;Moshe Schwartz;Xiaohu Tang
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the previous bound is unachievable for certain parameters. We then also provide explicit constructions of optimal codes which show that for certain parameters the new bound is sharp. Additionally, as a byproduct, some previously known codes are shown to attain the new bound and are thus proved to be optimal.
登录
查看更多内容
DOI：
10.1109/isit.2013.6620540
发表时间：
2013-01
期刊：
2013 IEEE International Symposium on Information Theory
影响因子：
--
作者：
Itzhak Tamo;Dimitris Papailiopoulos;A. Dimakis
通讯作者：
Itzhak Tamo;Dimitris Papailiopoulos;A. Dimakis
DOI：
10.1109/allerton.2018.8635867
发表时间：
2018-09
期刊：
2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
影响因子：
--
作者：
Umberto Martínez-Peñas;F. Kschischang
通讯作者：
Umberto Martínez-Peñas;F. Kschischang
影响因子：
2.5
作者：
Umberto Martínez-Peñas;F. Kschischang
通讯作者：
Umberto Martínez-Peñas;F. Kschischang
DOI：
10.1109/infcom.2007.232
发表时间：
2007-02
期刊：
IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications
影响因子：
--
作者：
A. Dimakis;Brighten Godfrey;M. Wainwright;K. Ramchandran
通讯作者：
A. Dimakis;Brighten Godfrey;M. Wainwright;K. Ramchandran
具有超线性长度的最优局部可修复码
影响因子：
2.5
作者：
Han Cai;Ying Miao;Moshe Schwartz;Xiaohu Tang
通讯作者：
Xiaohu Tang