Or Ordentlich

918 total citations
43 papers, 531 citations indexed

About

Or Ordentlich is a scholar working on Computer Networks and Communications, Electrical and Electronic Engineering and Computational Theory and Mathematics. According to data from OpenAlex, Or Ordentlich has authored 43 papers receiving a total of 531 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computer Networks and Communications, 22 papers in Electrical and Electronic Engineering and 10 papers in Computational Theory and Mathematics. Recurrent topics in Or Ordentlich's work include Wireless Communication Security Techniques (14 papers), Cooperative Communication and Network Coding (13 papers) and Error Correcting Code Techniques (12 papers). Or Ordentlich is often cited by papers focused on Wireless Communication Security Techniques (14 papers), Cooperative Communication and Network Coding (13 papers) and Error Correcting Code Techniques (12 papers). Or Ordentlich collaborates with scholars based in Israel and United States. Or Ordentlich's co-authors include Uri Erez, Yury Polyanskiy, Bobak Nazer, Gregory W. Wornell, Pavan Kumar Hanumolu, Andrew C. Singer, Jiening Zhan, Michael Gastpar, Ofer Shayevitz and Amir Weiss and has published in prestigious journals such as IEEE Transactions on Information Theory, IEEE Transactions on Signal Processing and IEEE Journal of Selected Topics in Signal Processing.

In The Last Decade

Or Ordentlich

39 papers receiving 519 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Or Ordentlich Israel	12	429	346	60	57	42	43	531
Valerio Bioglio France	11	323 0.8×	442 1.3×	94 1.6×	122 2.1×	60 1.4×	34	607
Saurabha Tavildar United States	8	632 1.5×	538 1.6×	90 1.5×	70 1.2×	11 0.3×	10	703
Farshad Lahouti Iran	12	417 1.0×	401 1.2×	68 1.1×	34 0.6×	23 0.5×	90	556
Y. Ye United States	3	265 0.6×	148 0.4×	66 1.1×	81 1.4×	15 0.4×	3	373
Zhengdao Wang United States	11	504 1.2×	381 1.1×	50 0.8×	39 0.7×	30 0.7×	22	586
Stefano Rini Taiwan	12	330 0.8×	260 0.8×	89 1.5×	33 0.6×	20 0.5×	71	402
Roland Gautier France	10	175 0.4×	192 0.6×	121 2.0×	30 0.5×	19 0.5×	34	300
R. Parra-Michel Mexico	12	359 0.8×	212 0.6×	43 0.7×	35 0.6×	25 0.6×	81	461
Marjan Karkooti United States	8	287 0.7×	277 0.8×	50 0.8×	25 0.4×	17 0.4×	10	359

Countries citing papers authored by Or Ordentlich

Since Specialization

Citations

This map shows the geographic impact of Or Ordentlich's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Or Ordentlich with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Or Ordentlich more than expected).

Fields of papers citing papers by Or Ordentlich

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Or Ordentlich. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Or Ordentlich. The network helps show where Or Ordentlich may publish in the future.

Co-authorship network of co-authors of Or Ordentlich

This figure shows the co-authorship network connecting the top 25 collaborators of Or Ordentlich. A scholar is included among the top collaborators of Or Ordentlich based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Or Ordentlich. Or Ordentlich is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Klartag, Bo’az & Or Ordentlich. (2025). The Strong Data Processing Inequality Under the Heat Flow. IEEE Transactions on Information Theory. 71(5). 3317–3333.

Ordentlich, Or, et al.. (2025). Memory Complexity of Estimating Entropy and Mutual Information. IEEE Transactions on Information Theory. 71(5). 3334–3349.

Ordentlich, Or, et al.. (2024). Statistical Inference With Limited Memory: A Survey. IEEE Journal on Selected Areas in Information Theory. 5. 623–644. 2 indexed citations

Ordentlich, Or, et al.. (2020). An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. 858–863. 1 indexed citations

Kim, Young-Han, et al.. (2019). The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity. 2868–2872. 1 indexed citations

Ordentlich, Or, et al.. (2019). Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. 2329–2333. 3 indexed citations

Ordentlich, Or, et al.. (2018). A Modulo-Based Architecture for Analog-to-Digital Conversion. IEEE Journal of Selected Topics in Signal Processing. 12(5). 825–840. 43 indexed citations

Ordentlich, Or & Uri Erez. (2018). Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM. IEEE Transactions on Information Theory. 65(2). 1153–1164. 3 indexed citations

Ordentlich, Or & Yury Polyanskiy. (2018). Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. DSpace@MIT (Massachusetts Institute of Technology). 11 indexed citations

10.

Ordentlich, Or & Yury Polyanskiy. (2017). Low complexity schemes for the random access Gaussian channel. 2528–2532. 129 indexed citations

11.

Ordentlich, Or, Ofer Shayevitz, & Omri Weinstein. (2016). An improved upper bound for the most informative boolean function conjecture. 500–504. 9 indexed citations

12.

Ordentlich, Or & Uri Erez. (2015). Performance analysis and optimal filter design for sigma-delta modulation via duality with DPCM. 321–325. 7 indexed citations

13.

Ordentlich, Or, Uri Erez, & Bobak Nazer. (2014). The Approximate Sum Capacity of the Symmetric Gaussian <inline-formula> <tex-math notation="TeX">$K$ </tex-math></inline-formula>-User Interference Channel. IEEE Transactions on Information Theory. 60(6). 3450–3482. 67 indexed citations

14.

Ordentlich, Or & Uri Erez. (2013). On the Robustness of Lattice Interference Alignment. IEEE Transactions on Information Theory. 59(5). 2735–2759. 13 indexed citations

15.

Ordentlich, Or, et al.. (2012). Decode-and-forward for the Gaussian relay channel via standard AWGN coding and decoding. 53. 457–461. 12 indexed citations

16.

Ordentlich, Or & Uri Erez. (2012). A simple proof for the existence of “good” pairs of nested lattices. 1–12. 10 indexed citations

17.

Ordentlich, Or & Uri Erez. (2011). Interference alignment at finite SNR for time-invariant channels. 442–446. 8 indexed citations

18.

Ordentlich, Or, Jiening Zhan, Uri Erez, Michael Gastpar, & Bobak Nazer. (2011). Practical code design for compute-and-forward. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 1876–1880. 21 indexed citations

19.

Ordentlich, Or & Uri Erez. (2011). Interference Alignment at Finite SNR. 1 indexed citations

20.

Ordentlich, Or & Uri Erez. (2010). Achieving the gains promised by Integer-Forcing equalization with binary codes. 703–707. 14 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact