default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOr Ordentlich
Person information
- affiliation: The Hebrew University of Jerusalem, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j24]Tomer Berg
, Or Ordentlich, Ofer Shayevitz:
Statistical Inference With Limited Memory: A Survey. IEEE J. Sel. Areas Inf. Theory 5: 623-644 (2024)- [c39]Uri Erez, Or Ordentlich, Shlomo Shamai:
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining. ISIT 2024: 3386-3391 - [i46]Uri Erez, Or Ordentlich, Shlomo Shamai:
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining. CoRR abs/2401.14710 (2024) - [i45]Bo'az Klartag, Or Ordentlich:
The strong data processing inequality under the heat flow. CoRR abs/2406.03427 (2024) - [i44]Tomer Berg, Or Ordentlich, Ofer Shayevitz:
Memory Complexity of Entropy Estimation. CoRR abs/2406.06312 (2024) - [i43]Or Ordentlich, Yury Polyanskiy:
Optimal Quantization for Matrix Multiplication. CoRR abs/2410.13780 (2024) - 2023
- [c38]Noam Gavish, Or Ordentlich:
Minimax Risk Upper Bounds Based on Shell Analysis of a Quantized Maximum Likelihood Estimator. ISIT 2023: 2105-2110 - [i42]Or Ordentlich, Oded Regev, Barak Weiss:
Bounds on the density of smooth lattice coverings. CoRR abs/2311.04644 (2023) - [i41]Tomer Berg, Or Ordentlich, Ofer Shayevitz:
Statistical Inference with Limited Memory: A Survey. CoRR abs/2312.15225 (2023) - 2022
- [j23]Michael Dikshtein, Or Ordentlich, Shlomo Shamai (Shitz):
The Double-Sided Information Bottleneck Function. Entropy 24(9): 1321 (2022) - [j22]Or Ordentlich, Yury Polyanskiy:
Strong Data Processing Constant Is Achieved by Binary Inputs. IEEE Trans. Inf. Theory 68(3): 1480-1481 (2022) - [j21]Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell:
Blind Modulo Analog-to-Digital Conversion. IEEE Trans. Signal Process. 70: 4586-4601 (2022) - [c37]Elad Romanov, Or Ordentlich:
Spiked Covariance Estimation from Modulo-Reduced Measurements. AISTATS 2022: 1298-1320 - [c36]Tomer Berg, Or Ordentlich, Ofer Shayevitz:
On The Memory Complexity of Uniformity Testing. COLT 2022: 3506-3523 - [c35]Elad Romanov, Tamir Bendory, Or Ordentlich:
On the Role of Channel Capacity in Learning Gaussian Mixture Models. COLT 2022: 4110-4159 - [c34]Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell:
Blind Modulo Analog-to-Digital Conversion of Vector Processes. ICASSP 2022: 5617-5621 - [i40]Elad Romanov, Tamir Bendory, Or Ordentlich:
On the Role of Channel Capacity in Learning Gaussian Mixture Models. CoRR abs/2202.07707 (2022) - [i39]Tomer Berg, Or Ordentlich, Ofer Shayevitz:
Deterministic Finite-Memory Bias Estimation. CoRR abs/2206.09390 (2022) - [i38]Tomer Berg, Or Ordentlich, Ofer Shayevitz:
On The Memory Complexity of Uniformity Testing. CoRR abs/2206.09395 (2022) - 2021
- [j20]Elad Romanov, Or Ordentlich:
On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel. Entropy 23(5): 605 (2021) - [j19]Elad Romanov, Tamir Bendory, Or Ordentlich:
Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition. SIAM J. Math. Data Sci. 3(2): 494-523 (2021) - [j18]Elad Romanov, Or Ordentlich:
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs. IEEE Trans. Inf. Theory 67(3): 1897-1919 (2021) - [j17]Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-Distilling Quantizers. IEEE Trans. Inf. Theory 67(4): 2472-2487 (2021) - [j16]Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz:
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels. IEEE Trans. Inf. Theory 67(12): 7639-7658 (2021) - [j15]Or Ordentlich, Ido Tal:
An Upgrading Algorithm With Optimal Power Law. IEEE Trans. Inf. Theory 67(12): 7822-7836 (2021) - [c33]Tomer Berg, Or Ordentlich, Ofer Shayevitz:
Deterministic Finite-Memory Bias Estimation. COLT 2021: 566-585 - [c32]Dror Drach, Or Ordentlich, Ofer Shayevitz:
Binary Maximal Correlation Bounds and Isoperimetric Inequalities via Anti-Concentration. ISIT 2021: 1284-1289 - [c31]Assaf Ben-Yishai, Or Ordentlich:
Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss. ISIT 2021: 2435-2440 - [c30]Michael Dikshtein, Or Ordentlich, Shlomo Shamai Shitz:
The Double-Sided Information-Bottleneck Function. ISIT 2021: 2495-2500 - [c29]Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby:
Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. ISIT 2021: 2625-2630 - [i37]Assaf Ben-Yishai, Or Ordentlich:
Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss. CoRR abs/2102.08184 (2021) - [i36]Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby:
Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. CoRR abs/2103.02646 (2021) - [i35]Elad Romanov, Or Ordentlich:
On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel. CoRR abs/2105.05350 (2021) - [i34]Elad Romanov, Or Ordentlich:
Spiked Covariance Estimation from Modulo-Reduced Measurements. CoRR abs/2110.01150 (2021) - [i33]Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell:
Blind Modulo Analog-to-Digital Conversion of Vector Processes. CoRR abs/2110.06183 (2021) - 2020
- [j14]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. IEEE Trans. Inf. Theory 66(8): 4722-4741 (2020) - [j13]Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz:
A Note on the Probability of Rectangles for Correlated Binary Strings. IEEE Trans. Inf. Theory 66(12): 7878-7886 (2020) - [c28]Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. ISIT 2020: 858-863 - [c27]Tomer Berg, Or Ordentlich, Ofer Shayevitz:
Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. ISIT 2020: 1259-1264 - [i32]Or Ordentlich, Ido Tal:
An Upgrading Algorithm with Optimal Power Law. CoRR abs/2004.00869 (2020) - [i31]Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. CoRR abs/2004.09935 (2020) - [i30]Tomer Berg, Ofer Shayevitz, Or Ordentlich:
Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. CoRR abs/2005.07445 (2020) - [i29]Or Ordentlich, Oded Regev, Barak Weiss:
New bounds on the density of lattice coverings. CoRR abs/2006.00340 (2020) - [i28]Elad Romanov, Tamir Bendory, Or Ordentlich:
Multi-reference alignment in high dimensions: sample complexity and phase transition. CoRR abs/2007.11482 (2020) - [i27]Or Ordentlich, Yury Polyanskiy:
Strong data processing constant is achieved by binary inputs. CoRR abs/2010.01987 (2020) - [i26]Ido Shahaf, Or Ordentlich, Gil Segev:
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. IACR Cryptol. ePrint Arch. 2020: 462 (2020)
2010 – 2019
- 2019
- [j12]Elad Romanov, Or Ordentlich:
Above the Nyquist Rate, Modulo Folding Does Not Hurt. IEEE Signal Process. Lett. 26(8): 1167-1171 (2019) - [j11]Or Ordentlich, Uri Erez:
Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM. IEEE Trans. Inf. Theory 65(2): 1153-1164 (2019) - [c26]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. ISIT 2019: 1332-1336 - [c25]Elad Romanov, Or Ordentlich:
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. ISIT 2019: 2329-2333 - [c24]Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz:
The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity. ISIT 2019: 2868-2872 - [i25]Elad Romanov, Or Ordentlich:
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. CoRR abs/1901.10396 (2019) - [i24]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. CoRR abs/1902.07979 (2019) - [i23]Elad Romanov, Or Ordentlich:
Above the Nyquist Rate, Modulo Folding Does Not Hurt. CoRR abs/1903.12289 (2019) - [i22]Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz:
A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels. CoRR abs/1908.07367 (2019) - [i21]Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz:
A Note on the Probability of Rectangles for Correlated Binary Strings. CoRR abs/1909.01221 (2019) - 2018
- [j10]Or Ordentlich, Gizem Tabak, Pavan Kumar Hanumolu, Andrew C. Singer, Gregory W. Wornell:
A Modulo-Based Architecture for Analog-to-Digital Conversion. IEEE J. Sel. Top. Signal Process. 12(5): 825-840 (2018) - [c23]S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke:
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. ISIT 2018: 311-315 - [c22]Or Ordentlich, Yury Polyanskiy:
Entropy Under Additive Bernoulli and Spherical Noises. ISIT 2018: 521-525 - [c21]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
Ozarow- Type Outer Bounds for Memoryless Sources and Channels. ISIT 2018: 1774-1778 - [i20]S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke:
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. CoRR abs/1801.09481 (2018) - [i19]Or Ordentlich, Gizem Tabak, Pavan Kumar Hanumolu, Andrew C. Singer, Gregory W. Wornell:
A Modulo-Based Architecture for Analog-to-Digital Conversion. CoRR abs/1806.08968 (2018) - [i18]Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-Distilling Quantizers. CoRR abs/1812.03031 (2018) - 2017
- [j9]Or Ordentlich, Uri Erez:
Integer-Forcing Source Coding. IEEE Trans. Inf. Theory 63(2): 1253-1269 (2017) - [c20]Wasim Huleihel, Or Ordentlich:
How to quantize n outputs of a binary symmetric channel to n - 1 bits? ISIT 2017: 91-95 - [c19]Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-distilling quantizers. ISIT 2017: 96-100 - [c18]Or Ordentlich, Yury Polyanskiy:
Low complexity schemes for the random access Gaussian channel. ISIT 2017: 2528-2532 - [i17]Wasim Huleihel, Or Ordentlich:
How to Quantize n Outputs of a Binary Symmetric Channel to n-1 Bits? CoRR abs/1701.03119 (2017) - 2016
- [j8]Or Ordentlich, Ofer Shayevitz:
An Upper Bound on the Sizes of Multiset-Union-Free Families. SIAM J. Discret. Math. 30(2): 1032-1045 (2016) - [j7]Or Ordentlich, Uri Erez:
A Simple Proof for the Existence of "Good" Pairs of Nested Lattices. IEEE Trans. Inf. Theory 62(8): 4439-4453 (2016) - [j6]Yanjun Han, Or Ordentlich, Ofer Shayevitz:
Mutual Information Bounds via Adjacency Events. IEEE Trans. Inf. Theory 62(11): 6068-6080 (2016) - [c17]Bobak Nazer, Or Ordentlich:
Diophantine approximation for network information theory: A survey of old and new results. Allerton 2016: 990-996 - [c16]Or Ordentlich, Ofer Shayevitz, Omri Weinstein:
An improved upper bound for the most informative boolean function conjecture. ISIT 2016: 500-504 - [c15]Or Ordentlich:
Novel lower bounds on the entropy rate of binary hidden Markov processes. ISIT 2016: 690-694 - [i16]Or Ordentlich:
Novel Lower Bounds on the Entropy Rate of Binary Hidden Markov Processes. CoRR abs/1601.06453 (2016) - 2015
- [j5]Or Ordentlich, Uri Erez:
Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap. IEEE Trans. Inf. Theory 61(1): 323-340 (2015) - [j4]Or Ordentlich, Ofer Shayevitz:
Minimum MS. E. Gerber's Lemma. IEEE Trans. Inf. Theory 61(11): 5883-5891 (2015) - [c14]Or Ordentlich, Uri Erez:
Performance analysis and optimal filter design for sigma-delta modulation via duality with DPCM. ISIT 2015: 321-325 - [c13]Or Ordentlich, Ofer Shayevitz:
A VC-dimension-based outer bound on the zero-error capacity of the binary adder channel. ISIT 2015: 2366-2370 - [c12]Or Ordentlich, Uri Erez, Bobak Nazer:
On compute-and-forward with feedback. ITW 2015: 1-5 - [c11]Or Ordentlich, Ofer Shayevitz:
Subset-universal lossy compression. ITW 2015: 1-5 - [i15]Or Ordentlich, Uri Erez:
Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM. CoRR abs/1501.01829 (2015) - [i14]Or Ordentlich, Ofer Shayevitz, Omri Weinstein:
Dictatorship is the Most Informative Balanced Function at the Extremes. CoRR abs/1505.05794 (2015) - [i13]Or Ordentlich, Ofer Shayevitz:
Minimum MS. E. Gerber's Lemma. CoRR abs/1506.00253 (2015) - [i12]Or Ordentlich, Ofer Shayevitz:
Mutual Information Bounds via Adjacency Events. CoRR abs/1507.06296 (2015) - [i11]Or Ordentlich, Ofer Shayevitz, Omri Weinstein:
Dictatorship is the Most Informative Balanced Function at the Extremes. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j3]Or Ordentlich, Uri Erez, Bobak Nazer:
The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel. IEEE Trans. Inf. Theory 60(6): 3450-3482 (2014) - [c10]Or Ordentlich, Uri Erez:
Integer-Forcing source coding. ISIT 2014: 181-185 - [c9]Or Ordentlich, Ofer Shayevitz:
Bounding techniques for the intrinsic uncertainty of channels. ISIT 2014: 3082-3086 - [i10]Or Ordentlich, Ofer Shayevitz:
Is There a Proficiency-Universal Language? CoRR abs/1411.0443 (2014) - [i9]Or Ordentlich, Ofer Shayevitz:
An Upper Bound on the Sizes of Multiset-Union-Free Families. CoRR abs/1412.8415 (2014) - [i8]Or Ordentlich, Ofer Shayevitz:
A VC-dimension-based Outer Bound on the Zero-Error Capacity of the Binary Adder Channel. CoRR abs/1412.8670 (2014) - 2013
- [j2]Or Ordentlich, Uri Erez:
On the Robustness of Lattice Interference Alignment. IEEE Trans. Inf. Theory 59(5): 2735-2759 (2013) - [c8]Or Ordentlich, Uri Erez, Bobak Nazer:
Successive integer-forcing and its sum-rate optimality. Allerton 2013: 282-292 - [c7]Or Ordentlich, Uri Erez:
Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap. ITW 2013: 1-5 - [i7]Or Ordentlich, Uri Erez:
Precoded Integer-Forcing Equalization Universally Achieves the MIMO Capacity up to a Constant Gap. CoRR abs/1301.6393 (2013) - [i6]Or Ordentlich, Uri Erez, Bobak Nazer:
Successive Integer-Forcing and its Sum-Rate Optimality. CoRR abs/1307.2105 (2013) - [i5]Or Ordentlich, Uri Erez:
Integer-Forcing Source Coding. CoRR abs/1308.6552 (2013) - 2012
- [j1]Or Ordentlich, Uri Erez:
Cyclic-Coded Integer-Forcing Equalization. IEEE Trans. Inf. Theory 58(9): 5804-5815 (2012) - [c6]Or Ordentlich, Uri Erez, Bobak Nazer:
The approximate sum capacity of the symmetric Gaussian K-user interference channel. ISIT 2012: 2072-2076 - [c5]Or Ordentlich, Uri Erez, Bobak Nazer:
The compute-and-forward transform. ISIT 2012: 3008-3012 - [c4]Anatoly Khina, Or Ordentlich, Uri Erez, Yuval Kochman, Gregory W. Wornell:
Decode-and-forward for the Gaussian relay channel via standard AWGN coding and decoding. ITW 2012: 457-461 - [i4]Or Ordentlich, Uri Erez, Bobak Nazer:
The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel. CoRR abs/1206.0197 (2012) - [i3]Or Ordentlich, Uri Erez:
A Simple Proof for the Existence of "Good" Pairs of Nested Lattices. CoRR abs/1209.5083 (2012) - 2011
- [c3]Or Ordentlich, Jiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer:
Practical code design for compute-and-forward. ISIT 2011: 1876-1880 - [c2]Or Ordentlich, Uri Erez:
Interference alignment at finite SNR for time-invariant channels. ITW 2011: 442-446 - [i2]Or Ordentlich, Uri Erez:
Interference Alignment at Finite SNR. CoRR abs/1104.5456 (2011) - 2010
- [c1]Or Ordentlich, Uri Erez:
Cyclic coded integer-forcing equalization. Allerton 2010: 474-478 - [i1]Or Ordentlich, Uri Erez:
Cyclic-Coded Integer-Forcing Equalization. CoRR abs/1012.5553 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
