Venkatesan Guruswami, Salil P. Vadhan. A Lower Bound on List Size for List Decoding. In Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan, editors, Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computat. Volume 3624 of Lecture Notes in Computer Science, pages 318-329, Springer, 2005. [doi]
@inproceedings{GuruswamiV05,
title = {A Lower Bound on List Size for List Decoding},
author = {Venkatesan Guruswami and Salil P. Vadhan},
year = {2005},
doi = {10.1007/11538462_27},
url = {http://dx.doi.org/10.1007/11538462_27},
researchr = {https://researchr.org/publication/GuruswamiV05},
cites = {0},
citedby = {0},
pages = {318-329},
booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computat},
editor = {Chandra Chekuri and Klaus Jansen and José D. P. Rolim and Luca Trevisan},
volume = {3624},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-28239-4},
}