@inproceedings{43fd5e2caeed43d384b6d1640eb6ffe0,
title = "Bounds on locally recoverable codes with multiple recovering sets",
abstract = "A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recovering set. Bounds on the rate and distance of such codes have been extensively studied in the literature. In this paper we derive upper bounds on the rate and distance of codes in which every symbol has t ≥ 1 disjoint recovering sets.",
author = "Itzhak Tamo and Alexander Barg",
year = "2014",
doi = "10.1109/ISIT.2014.6874921",
language = "الإنجليزيّة",
isbn = "9781479951864",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "691--695",
booktitle = "2014 IEEE International Symposium on Information Theory, ISIT 2014",
address = "الولايات المتّحدة",
note = "2014 IEEE International Symposium on Information Theory, ISIT 2014 ; Conference date: 29-06-2014 Through 04-07-2014",
}