Or Ordentlich

According to our database, Or Ordentlich authored at least 63 papers between 2011 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining.

Uri Erez, Or Ordentlich, Shlomo Shamai

CoRR, 2024

2023

Statistical Inference with Limited Memory: A Survey.

Tomer Berg, Or Ordentlich, Ofer Shayevitz

CoRR, 2023

Bounds on the density of smooth lattice coverings.

Or Ordentlich, Oded Regev, Barak Weiss

CoRR, 2023

Minimax Risk Upper Bounds Based on Shell Analysis of a Quantized Maximum Likelihood Estimator.

Noam Gavish, Or Ordentlich

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Blind Modulo Analog-to-Digital Conversion.

Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell

IEEE Trans. Signal Process., 2022

Strong Data Processing Constant Is Achieved by Binary Inputs.

Or Ordentlich, Yury Polyanskiy

IEEE Trans. Inf. Theory, 2022

The Double-Sided Information Bottleneck Function.

Michael Dikshtein, Or Ordentlich, Shlomo Shamai (Shitz)

Entropy, 2022

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

Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell

Proceedings of the IEEE International Conference on Acoustics, 2022

On the Role of Channel Capacity in Learning Gaussian Mixture Models.

Elad Romanov, Tamir Bendory, Or Ordentlich

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

On The Memory Complexity of Uniformity Testing.

Tomer Berg, Or Ordentlich, Ofer Shayevitz

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Spiked Covariance Estimation from Modulo-Reduced Measurements.

Elad Romanov, Or Ordentlich

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021

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

Elad Romanov, Or Ordentlich

IEEE Trans. Inf. Theory, 2021

An Upgrading Algorithm With Optimal Power Law.

Or Ordentlich, Ido Tal

IEEE Trans. Inf. Theory, 2021

Information-Distilling Quantizers.

Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy

IEEE Trans. Inf. Theory, 2021

A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels.

Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz

IEEE Trans. Inf. Theory, 2021

Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition.

Elad Romanov, Tamir Bendory, Or Ordentlich

SIAM J. Math. Data Sci., 2021

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

Elad Romanov, Or Ordentlich

Entropy, 2021

Binary Maximal Correlation Bounds and Isoperimetric Inequalities via Anti-Concentration.

Dror Drach, Or Ordentlich, Ofer Shayevitz

Proceedings of the IEEE International Symposium on Information Theory, 2021

Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss.

Assaf Ben-Yishai, Or Ordentlich

Proceedings of the IEEE International Symposium on Information Theory, 2021

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

Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby

Proceedings of the IEEE International Symposium on Information Theory, 2021

Deterministic Finite-Memory Bias Estimation.

Tomer Berg, Or Ordentlich, Ofer Shayevitz

Proceedings of the Conference on Learning Theory, 2021

2020

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

Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz

IEEE Trans. Inf. Theory, 2020

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

Yuval Kochman, Or Ordentlich, Yury Polyanskiy

IEEE Trans. Inf. Theory, 2020

An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.

Ido Shahaf, Or Ordentlich, Gil Segev

IACR Cryptol. ePrint Arch., 2020

New bounds on the density of lattice coverings.

Or Ordentlich, Oded Regev, Barak Weiss

CoRR, 2020

Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules.

Tomer Berg, Or Ordentlich, Ofer Shayevitz

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM.

Or Ordentlich, Uri Erez

IEEE Trans. Inf. Theory, 2019

Above the Nyquist Rate, Modulo Folding Does Not Hurt.

Elad Romanov, Or Ordentlich

IEEE Signal Process. Lett., 2019

A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels.

Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz

CoRR, 2019

The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity.

Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

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

Or Ordentlich, Gizem Tabak, Pavan Kumar Hanumolu, Andrew C. Singer, Gregory W. Wornell

IEEE J. Sel. Top. Signal Process., 2018

Entropy Under Additive Bernoulli and Spherical Noises.

Or Ordentlich, Yury Polyanskiy

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Ozarow- Type Outer Bounds for Memoryless Sources and Channels.

Yuval Kochman, Or Ordentlich, Yury Polyanskiy

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

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

S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Integer-Forcing Source Coding.

Or Ordentlich, Uri Erez

IEEE Trans. Inf. Theory, 2017

Low complexity schemes for the random access Gaussian channel.

Or Ordentlich, Yury Polyanskiy

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Information-distilling quantizers.

Bobak Nazer, Or Ordentlich, Yury Polyanskiy

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

How to quantize n outputs of a binary symmetric channel to n - 1 bits?

Wasim Huleihel, Or Ordentlich

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

A Simple Proof for the Existence of "Good" Pairs of Nested Lattices.

Or Ordentlich, Uri Erez

IEEE Trans. Inf. Theory, 2016

Mutual Information Bounds via Adjacency Events.

Yanjun Han, Or Ordentlich, Ofer Shayevitz

IEEE Trans. Inf. Theory, 2016

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

Or Ordentlich, Ofer Shayevitz

SIAM J. Discret. Math., 2016

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

Or Ordentlich, Ofer Shayevitz, Omri Weinstein

Proceedings of the IEEE International Symposium on Information Theory, 2016

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

Or Ordentlich

Proceedings of the IEEE International Symposium on Information Theory, 2016

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

Bobak Nazer, Or Ordentlich

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

Minimum MS. E. Gerber's Lemma.

Or Ordentlich, Ofer Shayevitz

IEEE Trans. Inf. Theory, 2015

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

Or Ordentlich, Uri Erez

IEEE Trans. Inf. Theory, 2015

Dictatorship is the Most Informative Balanced Function at the Extremes.

Or Ordentlich, Ofer Shayevitz, Omri Weinstein

Electron. Colloquium Comput. Complex., 2015

Mutual Information Bounds via Adjacency Events.

Or Ordentlich, Ofer Shayevitz

CoRR, 2015

Subset-universal lossy compression.

Or Ordentlich, Ofer Shayevitz

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

On compute-and-forward with feedback.

Or Ordentlich, Uri Erez, Bobak Nazer

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

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

Or Ordentlich, Ofer Shayevitz

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

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

Or Ordentlich, Uri Erez, Bobak Nazer

IEEE Trans. Inf. Theory, 2014

Is There a Proficiency-Universal Language?

Or Ordentlich, Ofer Shayevitz

CoRR, 2014

Bounding techniques for the intrinsic uncertainty of channels.

Or Ordentlich, Ofer Shayevitz

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

On the Robustness of Lattice Interference Alignment.

Or Ordentlich, Uri Erez

IEEE Trans. Inf. Theory, 2013

Precoded Integer-Forcing Equalization Universally Achieves the MIMO Capacity up to a Constant Gap

Or Ordentlich, Uri Erez

CoRR, 2013

Successive integer-forcing and its sum-rate optimality.

Or Ordentlich, Uri Erez, Bobak Nazer

Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012

Cyclic-Coded Integer-Forcing Equalization.

Or Ordentlich, Uri Erez

IEEE Trans. Inf. Theory, 2012

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

Anatoly Khina, Or Ordentlich, Uri Erez, Yuval Kochman, Gregory W. Wornell

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

The compute-and-forward transform.

Or Ordentlich, Uri Erez, Bobak Nazer

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Interference Alignment at Finite SNR

Or Ordentlich, Uri Erez

CoRR, 2011

Interference alignment at finite SNR for time-invariant channels.

Or Ordentlich, Uri Erez

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Practical code design for compute-and-forward.

Or Ordentlich, Jiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011