Weijun Fang, Fangwei Fu. Optimal Cyclic (r, ẟ) Locally Repairable Codes with Unbounded Length. In IEEE Information Theory Workshop, ITW 2018, Guangzhou, China, November 25-29, 2018. pages 1-5, IEEE, 2018. [doi]
@inproceedings{FangF18-2,
title = {Optimal Cyclic (r, ẟ) Locally Repairable Codes with Unbounded Length},
author = {Weijun Fang and Fangwei Fu},
year = {2018},
doi = {10.1109/ITW.2018.8613345},
url = {https://doi.org/10.1109/ITW.2018.8613345},
researchr = {https://researchr.org/publication/FangF18-2},
cites = {0},
citedby = {0},
pages = {1-5},
booktitle = {IEEE Information Theory Workshop, ITW 2018, Guangzhou, China, November 25-29, 2018},
publisher = {IEEE},
isbn = {978-1-5386-3599-5},
}