Go to the corresponding LIPIcs Volume Portal 
Guruswami, Venkatesan ; Xing, Chaoping ; Yuan, Chen
pdfformat: 

@InProceedings{guruswami_et_al:LIPIcs:2018:9445, author = {Venkatesan Guruswami and Chaoping Xing and Chen Yuan}, title = {{How Long Can Optimal Locally Repairable Codes Bel}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {41:141:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770859}, ISSN = {18688969}, year = {2018}, volume = {116}, editor = {Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9445}, URN = {urn:nbn:de:0030drops94458}, doi = {10.4230/LIPIcs.APPROXRANDOM.2018.41}, annote = {Keywords: Locally Repairable Code, Singleton Bound} }
Keywords:  Locally Repairable Code, Singleton Bound  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)  
Issue Date:  2018  
Date of publication:  02.08.2018 