Or Ordentlich

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 72

Top Venues

CoRR

ISIT

IEEE Trans. Inf. Theory

COLT

Publications

Uri Erez, Or Ordentlich, Shlomo Shamai
Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining. CoRR (2024)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Memory Complexity of Entropy Estimation. CoRR (2024)
Bo'az Klartag, Or Ordentlich
The strong data processing inequality under the heat flow. CoRR (2024)
Noam Gavish, Or Ordentlich
Minimax Risk Upper Bounds Based on Shell Analysis of a Quantized Maximum Likelihood Estimator. ISIT (2023)
Or Ordentlich, Oded Regev, Barak Weiss
Bounds on the density of smooth lattice coverings. CoRR (2023)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Statistical Inference with Limited Memory: A Survey. CoRR (2023)
Elad Romanov, Or Ordentlich
Spiked Covariance Estimation from Modulo-Reduced Measurements. AISTATS (2022)
Elad Romanov, Tamir Bendory, Or Ordentlich
On the Role of Channel Capacity in Learning Gaussian Mixture Models. CoRR (2022)
Elad Romanov, Tamir Bendory, Or Ordentlich
On the Role of Channel Capacity in Learning Gaussian Mixture Models. COLT (2022)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Deterministic Finite-Memory Bias Estimation. CoRR (2022)
Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell
Blind Modulo Analog-to-Digital Conversion. IEEE Trans. Signal Process. 70 (2022)
Michael Dikshtein, Or Ordentlich, Shlomo Shamai (Shitz)
The Double-Sided Information Bottleneck Function. Entropy 24 (9) (2022)
Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell
Blind Modulo Analog-to-Digital Conversion of Vector Processes. ICASSP (2022)
Or Ordentlich, Yury Polyanskiy
Strong Data Processing Constant Is Achieved by Binary Inputs. IEEE Trans. Inf. Theory 68 (3) (2022)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
On The Memory Complexity of Uniformity Testing. COLT (2022)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
On The Memory Complexity of Uniformity Testing. CoRR (2022)
Elad Romanov, Or Ordentlich
On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel. Entropy 23 (5) (2021)
Or Ordentlich, Ido Tal
An Upgrading Algorithm With Optimal Power Law. IEEE Trans. Inf. Theory 67 (12) (2021)
Elad Romanov, Tamir Bendory, Or Ordentlich
Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition. SIAM J. Math. Data Sci. 3 (2) (2021)
Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell
Blind Modulo Analog-to-Digital Conversion of Vector Processes. CoRR (2021)
Elad Romanov, Or Ordentlich
Spiked Covariance Estimation from Modulo-Reduced Measurements. CoRR (2021)
Assaf Ben-Yishai, Or Ordentlich
Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss. CoRR (2021)
Michael Dikshtein, Or Ordentlich, Shlomo Shamai Shitz
The Double-Sided Information-Bottleneck Function. ISIT (2021)
Elad Romanov, Or Ordentlich
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs. IEEE Trans. Inf. Theory 67 (3) (2021)
Dror Drach, Or Ordentlich, Ofer Shayevitz
Binary Maximal Correlation Bounds and Isoperimetric Inequalities via Anti-Concentration. ISIT (2021)
Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy
Information-Distilling Quantizers. IEEE Trans. Inf. Theory 67 (4) (2021)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Deterministic Finite-Memory Bias Estimation. COLT (2021)
Elad Romanov, Or Ordentlich
On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel. CoRR (2021)
Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby
Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. CoRR (2021)
Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby
Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. ISIT (2021)
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) (2021)
Assaf Ben-Yishai, Or Ordentlich
Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss. ISIT (2021)
Or Ordentlich, Yury Polyanskiy
Strong data processing constant is achieved by binary inputs. CoRR (2020)
Ido Shahaf, Or Ordentlich, Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. IACR Cryptol. ePrint Arch. 2020 (2020)
Elad Romanov, Tamir Bendory, Or Ordentlich
Multi-reference alignment in high dimensions: sample complexity and phase transition. CoRR (2020)
Or Ordentlich, Ido Tal
An Upgrading Algorithm with Optimal Power Law. CoRR (2020)
Ido Shahaf, Or Ordentlich, Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. CoRR (2020)
Yuval Kochman, Or Ordentlich, Yury Polyanskiy
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. IEEE Trans. Inf. Theory 66 (8) (2020)
Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz
A Note on the Probability of Rectangles for Correlated Binary Strings. IEEE Trans. Inf. Theory 66 (12) (2020)
Tomer Berg, Or Ordentlich, Ofer Shayevitz
Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. ISIT (2020)
Or Ordentlich, Oded Regev, Barak Weiss
New bounds on the density of lattice coverings. CoRR (2020)
Ido Shahaf, Or Ordentlich, Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. ISIT (2020)
Tomer Berg, Ofer Shayevitz, Or Ordentlich
Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. CoRR (2020)
Elad Romanov, Or Ordentlich
Above the Nyquist Rate, Modulo Folding Does Not Hurt. CoRR (2019)
Or Ordentlich, Uri Erez
Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM. IEEE Trans. Inf. Theory 65 (2) (2019)
Elad Romanov, Or Ordentlich
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. CoRR (2019)
Elad Romanov, Or Ordentlich
Above the Nyquist Rate, Modulo Folding Does Not Hurt. IEEE Signal Process. Lett. 26 (8) (2019)
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)
Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz
A Note on the Probability of Rectangles for Correlated Binary Strings. CoRR (2019)
Elad Romanov, Or Ordentlich
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. ISIT (2019)
Yuval Kochman, Or Ordentlich, Yury Polyanskiy
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. ISIT (2019)
Yuval Kochman, Or Ordentlich, Yury Polyanskiy
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. CoRR (2019)
Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz
A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels. CoRR (2019)
Or Ordentlich, Gizem Tabak, Pavan Kumar Hanumolu, Andrew C. Singer, Gregory W. Wornell
A Modulo-Based Architecture for Analog-to-Digital Conversion. CoRR (2018)
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)
Or Ordentlich, Yury Polyanskiy
Entropy Under Additive Bernoulli and Spherical Noises. ISIT (2018)
Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy
Information-Distilling Quantizers. CoRR (2018)
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) (2018)
Yuval Kochman, Or Ordentlich, Yury Polyanskiy
Ozarow- Type Outer Bounds for Memoryless Sources and Channels. ISIT (2018)
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 (2018)
Or Ordentlich, Uri Erez
Integer-Forcing Source Coding. IEEE Trans. Inf. Theory 63 (2) (2017)
Wasim Huleihel, Or Ordentlich
How to Quantize n Outputs of a Binary Symmetric Channel to n-1 Bits? CoRR (2017)
Wasim Huleihel, Or Ordentlich
How to quantize n outputs of a binary symmetric channel to n - 1 bits? ISIT (2017)
Bobak Nazer, Or Ordentlich, Yury Polyanskiy
Information-distilling quantizers. ISIT (2017)
Or Ordentlich, Yury Polyanskiy
Low complexity schemes for the random access Gaussian channel. ISIT (2017)
Yanjun Han, Or Ordentlich, Ofer Shayevitz
Mutual Information Bounds via Adjacency Events. IEEE Trans. Inf. Theory 62 (11) (2016)
Or Ordentlich, Ofer Shayevitz
An Upper Bound on the Sizes of Multiset-Union-Free Families. SIAM J. Discret. Math. 30 (2) (2016)
Or Ordentlich
Novel Lower Bounds on the Entropy Rate of Binary Hidden Markov Processes. CoRR (2016)
Or Ordentlich, Ofer Shayevitz, Omri Weinstein
An improved upper bound for the most informative boolean function conjecture. ISIT (2016)
Or Ordentlich
Novel lower bounds on the entropy rate of binary hidden Markov processes. ISIT (2016)
Bobak Nazer, Or Ordentlich
Diophantine approximation for network information theory: A survey of old and new results. Allerton (2016)
Or Ordentlich, Uri Erez
A Simple Proof for the Existence of "Good" Pairs of Nested Lattices. IEEE Trans. Inf. Theory 62 (8) (2016)
Or Ordentlich, Ofer Shayevitz
Mutual Information Bounds via Adjacency Events. CoRR (2015)
Or Ordentlich, Uri Erez, Bobak Nazer
On compute-and-forward with feedback. ITW (2015)
Or Ordentlich, Uri Erez
Performance analysis and optimal filter design for sigma-delta modulation via duality with DPCM. ISIT (2015)
Or Ordentlich, Uri Erez
Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap. IEEE Trans. Inf. Theory 61 (1) (2015)
Or Ordentlich, Uri Erez
Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM. CoRR (2015)
Or Ordentlich, Ofer Shayevitz
Subset-universal lossy compression. ITW (2015)
Or Ordentlich, Ofer Shayevitz
Minimum MS. E. Gerber's Lemma. IEEE Trans. Inf. Theory 61 (11) (2015)
Or Ordentlich, Ofer Shayevitz, Omri Weinstein
Dictatorship is the Most Informative Balanced Function at the Extremes. Electron. Colloquium Comput. Complex. 22 (2015)
Or Ordentlich, Ofer Shayevitz
A VC-dimension-based outer bound on the zero-error capacity of the binary adder channel. ISIT (2015)
Or Ordentlich, Ofer Shayevitz, Omri Weinstein
Dictatorship is the Most Informative Balanced Function at the Extremes. CoRR (2015)
Or Ordentlich, Ofer Shayevitz
Minimum MS. E. Gerber's Lemma. CoRR (2015)
Or Ordentlich, Ofer Shayevitz
Is There a Proficiency-Universal Language? CoRR (2014)
Or Ordentlich, Ofer Shayevitz
A VC-dimension-based Outer Bound on the Zero-Error Capacity of the Binary Adder Channel. CoRR (2014)
Or Ordentlich, Uri Erez, Bobak Nazer
The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel. IEEE Trans. Inf. Theory 60 (6) (2014)
Or Ordentlich, Uri Erez
Integer-Forcing source coding. ISIT (2014)
Or Ordentlich, Ofer Shayevitz
An Upper Bound on the Sizes of Multiset-Union-Free Families. CoRR (2014)
Or Ordentlich, Ofer Shayevitz
Bounding techniques for the intrinsic uncertainty of channels. ISIT (2014)
Or Ordentlich, Uri Erez, Bobak Nazer
Successive Integer-Forcing and its Sum-Rate Optimality. CoRR (2013)
Or Ordentlich, Uri Erez
Precoded Integer-Forcing Equalization Universally Achieves the MIMO Capacity up to a Constant Gap CoRR (2013)
Or Ordentlich, Uri Erez, Bobak Nazer
Successive integer-forcing and its sum-rate optimality. Allerton (2013)
Or Ordentlich, Uri Erez
Integer-Forcing Source Coding. CoRR (2013)
Or Ordentlich, Uri Erez
On the Robustness of Lattice Interference Alignment. IEEE Trans. Inf. Theory 59 (5) (2013)
Or Ordentlich, Uri Erez
Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap. ITW (2013)
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)
Or Ordentlich, Uri Erez
A Simple Proof for the Existence of "Good" Pairs of Nested Lattices CoRR (2012)
Or Ordentlich, Uri Erez, Bobak Nazer
The compute-and-forward transform. ISIT (2012)
Or Ordentlich, Uri Erez, Bobak Nazer
The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel CoRR (2012)
Or Ordentlich, Uri Erez, Bobak Nazer
The approximate sum capacity of the symmetric Gaussian K-user interference channel. ISIT (2012)

Or Ordentlich.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Or Ordentlich