Min Ye
Min Ye
Tsinghua-Berkeley Shenzhen Institute
Verified email at sz.tsinghua.edu.cn - Homepage
Title
Cited by
Cited by
Year
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
1372017
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
1022017
Communication-computation efficient gradient coding
M Ye, E Abbe
35th International Conference on Machine Learning (ICML), 5610-5619, 2018
952018
Optimal schemes for discrete distribution estimation under locally differential privacy
M Ye, A Barg
IEEE Transactions on Information Theory 64 (8), 5662-5676, 2018
942018
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
402016
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
392018
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
372017
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
292018
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
232018
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
162019
Recursive projection-aggregation decoding of Reed-Muller codes
M Ye, E Abbe
IEEE Transactions on Information Theory, 2020
122020
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
122017
Fractional decoding: Error correction from partial information
I Tamo, M Ye, A Barg
2017 IEEE International Symposium on Information Theory (ISIT), 998-1002, 2017
102017
Polar codes using dynamic kernels
M Ye, A Barg
2015 IEEE International Symposium on Information Theory (ISIT), 231-235, 2015
102015
Polar codes for distributed hierarchical source coding
M Ye, A Barg
Advances in Mathematics of Communications 9 (1), 87-103, 2015
92015
Asymptotically optimal private estimation under mean square loss
M Ye, A Barg
arXiv preprint arXiv:1708.00059, 2017
82017
Reed-Muller codes polarize
E Abbe, M Ye
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019
52019
Optimal MDS codes for cooperative repair
M Ye, A Barg
arXiv preprint ArXiv:1801.09665, 2018
52018
Reed-Muller Codes: Theory and Algorithms
E Abbe, A Shpilka, M Ye
arXiv preprint arXiv:2002.03317, 2020
42020
The repair problem for Reed-Solomon codes: Optimal repair of single and multiple erasures, asymptotically optimal node size
I Tamo, M Ye, A Barg
arXiv preprint arXiv:1805.01883, 2018
42018
The system can't perform the operation now. Try again later.
Articles 1–20