Published in: LIPIcs, Volume 116, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)
Michael Viderman. Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 116, pp. 58:1-58:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{viderman:LIPIcs.APPROX-RANDOM.2018.58, author = {Viderman, Michael}, title = {{Explicit Strong LTCs with Inverse Poly-Log Rate and Constant Soundness}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)}, pages = {58:1--58:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-085-9}, ISSN = {1868-8969}, year = {2018}, volume = {116}, editor = {Blais, Eric and Jansen, Klaus and D. P. Rolim, Jos\'{e} and Steurer, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2018.58}, URN = {urn:nbn:de:0030-drops-94620}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2018.58}, annote = {Keywords: Error-Correcting Codes, Tensor Products, Locally Testable Codes} }
Feedback for Dagstuhl Publishing