Or Ordentlich

Most-cited papers

1. Low complexity schemes for the random access Gaussian channel

   Or Ordentlich, Yury Polyanskiy

   2017International Symposium on Information Theory212 citations

   Semantic Scholar

   Save

2. The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel

   Or Ordentlich, Uri Erez, Bobak Nazer

   2012IEEE Transactions on Information Theory143 citations Open access

   Semantic Scholar

   Save

3. Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap

   Or Ordentlich, Uri Erez

   2013Information Theory Workshop83 citations Open access

   Semantic Scholar

   Save

4. A Simple Proof for the Existence of “Good” Pairs of Nested Lattices

   Or Ordentlich, Uri Erez

   2012IEEE Transactions on Information Theory83 citations Open access

   Semantic Scholar

   Save

5. Successive integer-forcing and its sum-rate optimality

   Or Ordentlich, Uri Erez, Bobak Nazer

   2013Allerton Conference on Communication, Control, and Computing76 citations

   Semantic Scholar

   Save

6. Above the Nyquist Rate, Modulo Folding Does Not Hurt

   Elad Romanov, Or Ordentlich

   2019IEEE Signal Processing Letters72 citations Open access

   Semantic Scholar

   Save

7. A Modulo-Based Architecture for Analog-to-Digital Conversion

   Or Ordentlich, Gizem Tabak, P. Hanumolu, A. Singer +1 more

   2018IEEE Journal on Selected Topics in Signal Processing61 citations Open access

   Semantic Scholar

   Save

8. Integer-Forcing source coding

   Or Ordentlich, Uri Erez

   20132014 IEEE International Symposium on Information Theory37 citations Open access

   Semantic Scholar

   Save

9. Practical code design for compute-and-forward

   Or Ordentlich, Jiening Zhan, Uri Erez, M. Gastpar +1 more

   2011IEEE International Symposium on Information Theory. Proceedings35 citations Open access

   Semantic Scholar

   Save

10. Information-Distilling Quantizers

    Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy

    2018IEEE Transactions on Information Theory34 citations Open access

    Semantic Scholar

    Save

11. NestQuant: Nested Lattice Quantization for Matrix Products and LLMs

    Semyon Savkin, Eitan Porat, Or Ordentlich, Yury Polyanskiy

    2025International Conference on Machine Learning29 citations

    Semantic Scholar

    Save

12. New bounds on the density of lattice coverings

    Or Ordentlich, O. Regev, Barak Weiss

    2020Journal of The American Mathematical Society28 citations Open access

    Semantic Scholar

    Save

13. Cyclic-Coded Integer-Forcing Equalization

    Or Ordentlich, Uri Erez

    2010IEEE Transactions on Information Theory26 citations Open access

    Semantic Scholar

    Save

14. Optimal Quantization for Matrix Multiplication

    Or Ordentlich, Yury Polyanskiy

    2024IEEE Transactions on Information Theory25 citations

    Semantic Scholar

    Save

15. Multi-reference alignment in high dimensions: sample complexity and phase transition

    Elad Romanov, Tamir Bendory, Or Ordentlich

    2020SIAM Journal on Mathematics of Data Science24 citations Open access

    Semantic Scholar

    Save

16. Strong Data Processing Constant Is Achieved by Binary Inputs

    Or Ordentlich, Yury Polyanskiy

    2020IEEE Transactions on Information Theory22 citations Open access

    Semantic Scholar

    Save

17. An improved upper bound for the most informative boolean function conjecture

    Or Ordentlich, O. Shayevitz, Omri Weinstein

    2015International Symposium on Information Theory22 citations Open access

    Semantic Scholar

    Save

18. On the Robustness of Lattice Interference Alignment

    Or Ordentlich, Uri Erez

    2013IEEE Transactions on Information Theory22 citations

    Semantic Scholar

    Save

19. Novel lower bounds on the entropy rate of binary hidden Markov processes

    Or Ordentlich

    2016International Symposium on Information Theory19 citations Open access

    Semantic Scholar

    Save

20. Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels

    Hamed Hassani, S. Kudekar, Or Ordentlich, Yury Polyanskiy +1 more

    2018International Symposium on Information Theory18 citations Open access

    Semantic Scholar

    Save

21. Blind Modulo Analog-to-Digital Conversion

    A. Weiss, Everest W. Huang, Or Ordentlich, G. Wornell

    2021IEEE Transactions on Signal Processing17 citations Open access

    Semantic Scholar

    Save

22. Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs

    Elad Romanov, Or Ordentlich

    2019IEEE Transactions on Information Theory17 citations Open access

    Semantic Scholar

    Save

23. Decode-and-forward for the Gaussian relay channel via standard AWGN coding and decoding

    Anatoly Khina, Or Ordentlich, Uri Erez, Yuval Kochman +1 more

    20122012 IEEE Information Theory Workshop17 citations

    Semantic Scholar

    Save

24. Integer-Forcing architectures for MIMO: Distributed implementation and SIC

    Jiening Zhan, Bobak Nazer, Or Ordentlich, Uri Erez +1 more

    20102010 Conference Record of the Forty Fourth Asilomar Conference on Signals, Systems and Computers17 citations Open access

    Semantic Scholar

    Save

25. Achieving the gains promised by Integer-Forcing equalization with binary codes

    Or Ordentlich, Uri Erez

    20102010 IEEE 26-th Convention of Electrical and Electronics Engineers in Israel17 citations

    Semantic Scholar

    Save

26. The Strong Data Processing Inequality Under the Heat Flow

    Bo'az Klartag, Or Ordentlich

    2024IEEE Transactions on Information Theory16 citations Open access

    Semantic Scholar

    Save

27. A VC-dimension-based outer bound on the zero-error capacity of the binary adder channel

    Or Ordentlich, O. Shayevitz

    2014International Symposium on Information Theory12 citations Open access

    Semantic Scholar

    Save

28. A Note on the Probability of Rectangles for Correlated Binary Strings

    Or Ordentlich, Yury Polyanskiy, O. Shayevitz

    2019IEEE Transactions on Information Theory11 citations Open access

    Semantic Scholar

    Save

29. A Lower Bound on the Expected Distortion of Joint Source-Channel Coding

    Yuval Kochman, Or Ordentlich, Yury Polyanskiy

    2019IEEE Transactions on Information Theory10 citations Open access

    Semantic Scholar

    Save

30. Ozarow- Type Outer Bounds for Memoryless Sources and Channels

    Yuval Kochman, Or Ordentlich, Yury Polyanskiy

    2018International Symposium on Information Theory10 citations Open access

    Semantic Scholar

    Save

31. Performance analysis and optimal filter design for sigma-delta modulation via duality with DPCM

    Or Ordentlich, Uri Erez

    2015International Symposium on Information Theory10 citations

    Semantic Scholar

    Save

32. An Upper Bound on the Sizes of Multiset-Union-Free Families

    Or Ordentlich, O. Shayevitz

    2014SIAM Journal on Discrete Mathematics10 citations Open access

    Semantic Scholar

    Save

33. Interference alignment at finite SNR for time-invariant channels

    Or Ordentlich, Uri Erez

    20112011 IEEE Information Theory Workshop9 citations

    Semantic Scholar

    Save

34. WaterSIC: information-theoretically (near) optimal linear layer quantization

    Egor Lifar, Semyon Savkin, Or Ordentlich, Yury Polyanskiy

    2026arXiv.org8 citations

    Semantic Scholar

    Save

35. Bounds on the density of smooth lattice coverings

    Or Ordentlich, O. Regev, Barak Weiss

    2023arXiv.org8 citations

    Semantic Scholar

    Save

36. On The Memory Complexity of Uniformity Testing

    Tomer Berg, Or Ordentlich, O. Shayevitz

    2022Annual Conference Computational Learning Theory8 citations Open access

    Semantic Scholar

    Save

37. On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel

    Elad Romanov, Or Ordentlich

    2021Entropy8 citations Open access

    Semantic Scholar

    Save

38. High-Rate Quantized Matrix Multiplication I

    Or Ordentlich, Yury Polyanskiy

    2026IEEE BITS the Information Theory Magazine7 citations

    Semantic Scholar

    Save

39. The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding

    Or Ordentlich

    2025IEEE Transactions on Information Theory7 citations Open access

    Semantic Scholar

    Save

40. Blind Modulo Analog-to-Digital Conversion of Vector Processes

    A. Weiss, Everest W. Huang, Or Ordentlich, G. Wornell

    2021IEEE International Conference on Acoustics, Speech, and Signal Processing7 citations

    Semantic Scholar

    Save

41. How to quantize n outputs of a binary symmetric channel to n − 1 bits?

    Wasim Huleihel, Or Ordentlich

    2017International Symposium on Information Theory7 citations Open access

    Semantic Scholar

    Save

42. Mutual Information Bounds via Adjacency Events

    Yan-Jun Han, Or Ordentlich, O. Shayevitz

    2015IEEE Transactions on Information Theory7 citations Open access

    Semantic Scholar

    Save

43. Minimum MS. E. Gerber’s Lemma

    Or Ordentlich, O. Shayevitz

    2015IEEE Transactions on Information Theory7 citations Open access

    Semantic Scholar

    Save

44. The compute-and-forward transform

    Or Ordentlich, Uri Erez, Bobak Nazer

    2012IEEE International Symposium on Information Theory. Proceedings7 citations

    Semantic Scholar

    Save

45. Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules

    Tomer Berg, Or Ordentlich, O. Shayevitz

    2020International Symposium on Information Theory6 citations Open access

    Semantic Scholar

    Save

46. Diophantine approximation for network information theory: A survey of old and new results

    Bobak Nazer, Or Ordentlich

    2016Allerton Conference on Communication, Control, and Computing6 citations

    Semantic Scholar

    Save

47. High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables

    Iris Kaplan, Or Ordentlich

    2025International Symposium on Information Theory5 citations Open access

    Semantic Scholar

    Save

48. Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems

    Shlomi Agrnon, Etam Benger, Or Ordentlich, Naftali Tishby

    2021International Symposium on Information Theory5 citations Open access

    Semantic Scholar

    Save

49. Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap

    Or Ordentlich, Uri Erez

    2015IEEE Transactions on Information Theory5 citations Open access

    Semantic Scholar

    Save

50. Dictatorship is the Most Informative Balanced Function at the Extremes

    Or Ordentlich, O. Shayevitz, Omri Weinstein

    2015Electron. Colloquium Comput. Complex.5 citations

    Semantic Scholar

    Save