Author of the publication

On List Recovery of High-Rate Tensor Codes.

, , , , and . APPROX-RANDOM, volume 145 of LIPIcs, page 68:1-68:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes., and . Theory Comput., (2013)Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size., , and . CoRR, (2024)Local List Recovery of High-Rate Tensor Codes & Applications., , and . FOCS, page 204-215. IEEE Computer Society, (2017)Efficient List-Decoding With Constant Alphabet and List Sizes., and . IEEE Trans. Inf. Theory, 68 (3): 1663-1682 (2022)Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)., , and . Electron. Colloquium Comput. Complex., (2020)Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword., , and . Theory Comput., (2021)Linear-Time Erasure List-Decoding of Expander Codes., , and . IEEE Trans. Inf. Theory, 67 (9): 5827-5839 (2021)An Additive Combinatorics Approach Relating Rank to Communication Complexity., , and . J. ACM, 61 (4): 22:1-22:18 (2014)Local List Recovery of High-Rate Tensor Codes and Applications., , and . SIAM J. Comput., (2020)A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes., and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 639-650. Springer, (2012)