Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes

Kenji Obata. Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes. In José D. P. Rolim, Salil P. Vadhan, editors, Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings. Volume 2483 of Lecture Notes in Computer Science, pages 39-50, Springer, 2002. [doi]

@inproceedings{Obata02,
  title = {Optimal Lower Bounds for 2-Query Locally Decodable Linear Codes},
  author = {Kenji Obata},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2483/24830039.htm},
  researchr = {https://researchr.org/publication/Obata02},
  cites = {0},
  citedby = {0},
  pages = {39-50},
  booktitle = {Randomization and Approximation Techniques, 6th International Workshop, RANDOM 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings},
  editor = {José D. P. Rolim and Salil P. Vadhan},
  volume = {2483},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44147-6},
}