| Error correction coding over multiple memory pages M Anholt, O Ordentlich, N Sommer, O Shalvi US Patent 9,136,879, 2015 | 415 | 2015 |
| Low complexity schemes for the random access Gaussian channel O Ordentlich, Y Polyanskiy 2017 IEEE International Symposium on Information Theory (ISIT), 2528-2532, 2017 | 240 | 2017 |
| The Approximate Sum Capacity of the Symmetric Gaussian -User Interference Channel O Ordentlich, U Erez, B Nazer IEEE Transactions on Information Theory 60 (6), 3450-3482, 2014 | 162 | 2014 |
| Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap O Ordentlich, U Erez IEEE Transactions on Information Theory 61 (1), 323-340, 2014 | 100 | 2014 |
| A simple proof for the existence of “good” pairs of nested lattices O Ordentlich, U Erez IEEE Transactions on Information Theory 62 (8), 4439-4453, 2016 | 91 | 2016 |
| Rejuvenation of analog memory cells B Rotbard, N Sommer, S Winter, O Shalvi, D Sokolov, O Ordentlich, ... US Patent App. 12/649,382, 2009 | 90 | 2009 |
| Successive Integer-Forcing and its Sum-Rate Optimality O Ordentlich, U Erez, B Nazer Communication, Control, and Computing (Allerton), 2013 51st Annual Allerton …, 2013 | 85 | 2013 |
| Error correction coding over multiple memory pages M Anholt, O Ordentlich, N Sommer, O Shalvi US Patent 8,495,465, 2013 | 82 | 2013 |
| Above the Nyquist rate, modulo folding does not hurt E Romanov, O Ordentlich IEEE Signal Processing Letters 26 (8), 1167-1171, 2019 | 74 | 2019 |
| A modulo-based architecture for analog-to-digital conversion O Ordentlich, G Tabak, PK Hanumolu, AC Singer, GW Wornell IEEE journal of selected topics in signal processing 12 (5), 825-840, 2018 | 68 | 2018 |
| Integer-forcing source coding O Ordentlich, U Erez IEEE Transactions on Information Theory 63 (2), 1253-1269, 2016 | 46 | 2016 |
| Information-Distilling Quantizers A Bhatt, B Nazer, O Ordentlich, Y Polyanskiy IEEE Transactions on Information Theory 67 (4), 2472-2487, 2021 | 43* | 2021 |
| Practical code design for compute-and-forward O Ordentlich, J Zhan, U Erez, M Gastpar, B Nazer 2011 IEEE International Symposium on Information Theory Proceedings, 1876-1880, 2011 | 43 | 2011 |
| Cyclic-coded integer-forcing equalization O Ordentlich, U Erez IEEE transactions on information theory 58 (9), 5804-5815, 2012 | 33 | 2012 |
| An upper bound on the sizes of multiset-union-free families O Ordentlich, O Shayevitz SIAM Journal on Discrete Mathematics 30 (2), 1032-1045, 2016 | 28* | 2016 |
| Multi-reference alignment in high dimensions: Sample complexity and phase transition E Romanov, T Bendory, O Ordentlich SIAM Journal on Mathematics of Data Science 3 (2), 494-523, 2021 | 27 | 2021 |
| An improved upper bound for the most informative Boolean function conjecture O Ordentlich, O Shayevitz, O Weinstein 2016 IEEE International Symposium on Information Theory (ISIT), 500-504, 2016 | 26* | 2016 |
| On the robustness of lattice interference alignment O Ordentlich, U Erez IEEE transactions on information theory 59 (5), 2735-2759, 2013 | 25 | 2013 |
| Strong data processing constant is achieved by binary inputs O Ordentlich, Y Polyanskiy IEEE Transactions on Information Theory 68 (3), 1480-1481, 2021 | 23 | 2021 |
| New bounds on the density of lattice coverings O Ordentlich, O Regev, B Weiss Journal of the American Mathematical Society 35 (1), 295-308, 2022 | 22 | 2022 |
Ofer ShayevitzTel Aviv UniversityVerified email at eng.tau.ac.il
