| Explicit constructions of high-rate MDS array codes with optimal repair bandwidth M Ye, A Barg IEEE Transactions on Information Theory 63 (4), 2001-2014, 2017 | 240 | 2017 |
| Optimal schemes for discrete distribution estimation under locally differential privacy M Ye, A Barg IEEE Transactions on Information Theory 64 (8), 5662-5676, 2018 | 207 | 2018 |
| Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization M Ye, A Barg IEEE Transactions on Information Theory 63 (10), 6307-6317, 2017 | 194 | 2017 |
| Communication-computation efficient gradient coding M Ye, E Abbe 35th International Conference on Machine Learning (ICML), 5610-5619, 2018 | 190 | 2018 |
| Clay codes: Moulding {MDS} codes to yield an {MSR} code M Vajha, V Ramkumar, B Puranik, G Kini, E Lobo, B Sasidharan, ... 16th USENIX Conference on File and Storage Technologies (FAST 18), 139-154, 2018 | 122 | 2018 |
| Reed–Muller codes: Theory and algorithms E Abbe, A Shpilka, M Ye IEEE Transactions on Information Theory 67 (6), 3251-3277, 2020 | 91 | 2020 |
| Recursive projection-aggregation decoding of Reed-Muller codes M Ye, E Abbe IEEE Transactions on Information Theory 66 (8), 4948-4965, 2020 | 80 | 2020 |
| Optimal repair of Reed-Solomon codes: Achieving the cut-set bound I Tamo, M Ye, A Barg 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 216-227, 2017 | 75 | 2017 |
| Explicit constructions of MDS array codes and RS codes with optimal repair bandwidth M Ye, A Barg 2016 IEEE International Symposium on Information Theory (ISIT), 1202-1206, 2016 | 60 | 2016 |
| The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures with almost optimal node size I Tamo, M Ye, A Barg IEEE Transactions on Information Theory 65 (5), 2673-2695, 2019 | 56 | 2019 |
| Cooperative repair: Constructions of optimal MDS codes for all admissible parameters M Ye, A Barg IEEE Transactions on Information Theory 65 (3), 1639-1656, 2018 | 55 | 2018 |
| Reed-Muller codes polarize E Abbe, M Ye IEEE Transactions on Information Theory 66 (12), 7311-7332, 2020 | 41 | 2020 |
| Construction of polar codes for arbitrary discrete memoryless channels TC Gulcu, M Ye, A Barg IEEE Transactions on Information Theory 64 (1), 309-321, 2018 | 40 | 2018 |
| Arikan meets Shannon: Polar codes with near-optimal convergence to channel capacity V Guruswami, A Riazanov, M Ye Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 27 | 2020 |
| Enabling optimal access and error correction for the repair of Reed–Solomon codes Z Chen, M Ye, A Barg IEEE Transactions on Information Theory 66 (12), 7439-7456, 2020 | 26 | 2020 |
| Cyclically equivariant neural decoders for cyclic codes X Chen, M Ye arXiv preprint arXiv:2105.05540, 2021 | 24 | 2021 |
| Fractional decoding: Error correction from partial information I Tamo, M Ye, A Barg 2017 IEEE International Symposium on Information Theory (ISIT), 998-1002, 2017 | 17 | 2017 |
| Polar codes using dynamic kernels M Ye, A Barg 2015 IEEE International Symposium on Information Theory (ISIT), 231-235, 2015 | 16 | 2015 |
| Repairing Reed-Solomon codes: Universally achieving the cut-set bound for any number of erasures M Ye, A Barg arXiv preprint arXiv:1710.07216, 2017 | 15 | 2017 |
| New Constructions of Cooperative MSR Codes: Reducing Node Size to exp(O(n)) M Ye IEEE Transactions on Information Theory 66 (12), 7457-7464, 2020 | 14 | 2020 |
Alexander BargUniversity of MarylandAdresse e-mail validée de umd.edu