| Codeword or noise? Exact random coding exponents for joint detection and decoding N Weinberger, N Merhav IEEE transactions on information theory 60 (9), 5077-5094, 2014 | 28 | 2014 |
| The DNA storage channel: Capacity and error probability bounds N Weinberger, N Merhav IEEE Transactions on Information Theory 68 (9), 5657-5700, 2022 | 24 | 2022 |
| Optimum tradeoffs between the error exponent and the excess-rate exponent of variable-rate Slepian–Wolf coding N Weinberger, N Merhav IEEE Transactions on Information Theory 61 (4), 2165-2190, 2015 | 20 | 2015 |
| Large deviations behavior of the logarithmic error probability of random codes R Tamir, N Merhav, N Weinberger, AG i Fabregas IEEE Transactions on Information Theory 66 (11), 6635-6659, 2020 | 19 | 2020 |
| On the reliability function of distributed hypothesis testing under optimal detection N Weinberger, Y Kochman IEEE Transactions on Information Theory 65 (8), 4940-4965, 2019 | 19 | 2019 |
| A large deviations approach to secure lossy compression N Weinberger, N Merhav IEEE Transactions on Information Theory 63 (4), 2533-2559, 2017 | 16 | 2017 |
| Exponent trade-off for hypothesis testing over noisy channels N Weinberger, Y Kochman, M Wigger 2019 IEEE International Symposium on Information Theory (ISIT), 1852-1856, 2019 | 13 | 2019 |
| Error probability bounds for coded-index DNA storage systems N Weinberger IEEE Transactions on Information Theory 68 (11), 7005-7022, 2022 | 11 | 2022 |
| Generalization bounds and algorithms for learning to communicate over additive noise channels N Weinberger IEEE Transactions on Information Theory 68 (3), 1886-1921, 2021 | 11 | 2021 |
| The DNA storage channel: Capacity and error probability N Weinberger, N Merhav arXiv preprint arXiv:2109.12549, 2021 | 11 | 2021 |
| Erasure/list random coding error exponents are not universally achievable W Huleihel, N Weinberger, N Merhav IEEE Transactions on Information Theory 62 (10), 5403-5421, 2016 | 11 | 2016 |
| On the optimal Boolean function for prediction under quadratic loss N Weinberger, O Shayevitz IEEE Transactions on Information Theory 63 (7), 4202-4217, 2017 | 10 | 2017 |
| Channel detection in coded communication N Weinberger, N Merhav IEEE Transactions on Information Theory 63 (10), 6364-6392, 2017 | 9 | 2017 |
| Lower bounds on parameter modulation–estimation under bandwidth constraints N Weinberger, N Merhav IEEE Transactions on Information Theory 63 (6), 3854-3874, 2017 | 8 | 2017 |
| Learning maximum margin channel decoders A Tsvieli, N Weinberger IEEE Transactions on Information Theory 69 (6), 3597-3626, 2023 | 7 | 2023 |
| Universal decoding for linear Gaussian fading channels in the competitive minimax sense N Weinberger, M Feder 2008 IEEE International Symposium on Information Theory, 782-786, 2008 | 7 | 2008 |
| The EM algorithm is adaptively-optimal for unbalanced symmetric Gaussian mixtures N Weinberger, G Bresler Journal of Machine Learning Research 23 (103), 1-79, 2022 | 6 | 2022 |
| Guessing with a bit of help N Weinberger, O Shayevitz Entropy 22 (1), 39, 2019 | 6 | 2019 |
| Simplified erasure/list decoding N Weinberger, N Merhav IEEE Transactions on Information Theory 63 (7), 4218-4239, 2017 | 6 | 2017 |
| The Joint Effect of Task Similarity and Overparameterization on Catastrophic Forgetting--An Analytical Model I Evron, D Goldfarb, N Weinberger, D Soudry, P Hand arXiv preprint arXiv:2401.12617, 2024 | 4 | 2024 |
Neri MerhavProfessor of Electrical Engineering, Technion, Israel.在 ee.technion.ac.il 的电子邮件经过验证
