Practical code design for compute-and-forward. - Or Ordentlich; Jiening Zhan; Uri Erez; Michael Gastpar; Bobak Nazer (ISIT, 2011)

Interference alignment at finite SNR for time-invariant channels. - Or Ordentlich; Uri Erez (ITW, 2011)

Interference Alignment at Finite SNR - Or Ordentlich; Uri Erez (CoRR, 2011)

The compute-and-forward transform. - Or Ordentlich; Uri Erez; Bobak Nazer (ISIT, 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 (ITW, 2012)

Cyclic-Coded Integer-Forcing Equalization. - Or Ordentlich; Uri Erez (IEEE Trans. Inf. Theory, 2012)

Successive integer-forcing and its sum-rate optimality. - Or Ordentlich; Uri Erez; Bobak Nazer (Allerton, 2013)

Precoded Integer-Forcing Equalization Universally Achieves the MIMO Capacity up to a Constant Gap - Or Ordentlich; Uri Erez (CoRR, 2013)

On the Robustness of Lattice Interference Alignment. - Or Ordentlich; Uri Erez (IEEE Trans. Inf. Theory, 2013)

Bounding techniques for the intrinsic uncertainty of channels. - Or Ordentlich; Ofer Shayevitz (ISIT, 2014)

Is There a Proficiency-Universal Language? - Or Ordentlich; Ofer Shayevitz (CoRR, 2014)

The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel. - Or Ordentlich; Uri Erez; Bobak Nazer (IEEE Trans. Inf. Theory, 2014)

A VC-dimension-based outer bound on the zero-error capacity of the binary adder channel. - Or Ordentlich; Ofer Shayevitz (ISIT, 2015)

On compute-and-forward with feedback. - Or Ordentlich; Uri Erez; Bobak Nazer (ITW, 2015)

Subset-universal lossy compression. - Or Ordentlich; Ofer Shayevitz (ITW, 2015)

Mutual Information Bounds via Adjacency Events. - Or Ordentlich; Ofer Shayevitz (CoRR, 2015)

Dictatorship is the Most Informative Balanced Function at the Extremes. - Or Ordentlich; Ofer Shayevitz; Omri Weinstein (Electron. Colloquium Comput. Complex., 2015)

Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap. - Or Ordentlich; Uri Erez (IEEE Trans. Inf. Theory, 2015)

Minimum MS. E. Gerber's Lemma. - Or Ordentlich; Ofer Shayevitz (IEEE Trans. Inf. Theory, 2015)

Diophantine approximation for network information theory: A survey of old and new results. - Bobak Nazer; Or Ordentlich (Allerton, 2016)

Novel lower bounds on the entropy rate of binary hidden Markov processes. - Or Ordentlich (ISIT, 2016)

An improved upper bound for the most informative boolean function conjecture. - Or Ordentlich; Ofer Shayevitz; Omri Weinstein (ISIT, 2016)

An Upper Bound on the Sizes of Multiset-Union-Free Families. - Or Ordentlich; Ofer Shayevitz (SIAM J. Discret. Math., 2016)

Mutual Information Bounds via Adjacency Events. - Yanjun Han; Or Ordentlich; Ofer Shayevitz (IEEE Trans. Inf. Theory, 2016)

A Simple Proof for the Existence of "Good" Pairs of Nested Lattices. - Or Ordentlich; Uri Erez (IEEE Trans. Inf. Theory, 2016)

How to quantize n outputs of a binary symmetric channel to n - 1 bits? - Wasim Huleihel; Or Ordentlich (ISIT, 2017)

Information-distilling quantizers. - Bobak Nazer; Or Ordentlich; Yury Polyanskiy (ISIT, 2017)

Low complexity schemes for the random access Gaussian channel. - Or Ordentlich; Yury Polyanskiy (ISIT, 2017)

Integer-Forcing Source Coding. - Or Ordentlich; Uri Erez (IEEE Trans. Inf. Theory, 2017)

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 (ISIT, 2018)

Ozarow- Type Outer Bounds for Memoryless Sources and Channels. - Yuval Kochman; Or Ordentlich; Yury Polyanskiy (ISIT, 2018)

Entropy Under Additive Bernoulli and Spherical Noises. - Or Ordentlich; Yury Polyanskiy (ISIT, 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)

The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity. - Assaf Ben-Yishai; Young-Han Kim 001; Or Ordentlich; Ofer Shayevitz (ISIT, 2019)

A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels. - Assaf Ben-Yishai; Young-Han Kim 001; Or Ordentlich; Ofer Shayevitz (CoRR, 2019)

Above the Nyquist Rate, Modulo Folding Does Not Hurt. - Elad Romanov; Or Ordentlich (IEEE Signal Process. Lett., 2019)

Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM. - Or Ordentlich; Uri Erez (IEEE Trans. Inf. Theory, 2019)

Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. - Tomer Berg; Or Ordentlich; Ofer Shayevitz (ISIT, 2020)

New bounds on the density of lattice coverings. - Or Ordentlich; Oded Regev 001; Barak Weiss (CoRR, 2020)

An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. - Ido Shahaf; Or Ordentlich; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2020)

A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. - Yuval Kochman; Or Ordentlich; Yury Polyanskiy (IEEE Trans. Inf. Theory, 2020)

A Note on the Probability of Rectangles for Correlated Binary Strings. - Or Ordentlich; Yury Polyanskiy; Ofer Shayevitz (IEEE Trans. Inf. Theory, 2020)

Deterministic Finite-Memory Bias Estimation. - Tomer Berg; Or Ordentlich; Ofer Shayevitz (COLT, 2021)

Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. - Shlomi Agmon; Etam Benger; Or Ordentlich; Naftali Tishby (ISIT, 2021)

Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss. - Assaf Ben-Yishai; Or Ordentlich (ISIT, 2021)

Binary Maximal Correlation Bounds and Isoperimetric Inequalities via Anti-Concentration. - Dror Drach; Or Ordentlich; Ofer Shayevitz (ISIT, 2021)

On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel. - Elad Romanov; Or Ordentlich (Entropy, 2021)

Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition. - Elad Romanov; Tamir Bendory; Or Ordentlich (SIAM J. Math. Data Sci., 2021)

A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels. - Assaf Ben-Yishai; Young-Han Kim 001; Or Ordentlich; Ofer Shayevitz (IEEE Trans. Inf. Theory, 2021)

Information-Distilling Quantizers. - Alankrita Bhatt; Bobak Nazer; Or Ordentlich; Yury Polyanskiy (IEEE Trans. Inf. Theory, 2021)

An Upgrading Algorithm With Optimal Power Law. - Or Ordentlich; Ido Tal (IEEE Trans. Inf. Theory, 2021)

Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs. - Elad Romanov; Or Ordentlich (IEEE Trans. Inf. Theory, 2021)

Spiked Covariance Estimation from Modulo-Reduced Measurements. - Elad Romanov; Or Ordentlich (AISTATS, 2022)

On The Memory Complexity of Uniformity Testing. - Tomer Berg; Or Ordentlich; Ofer Shayevitz (COLT, 2022)

On the Role of Channel Capacity in Learning Gaussian Mixture Models. - Elad Romanov; Tamir Bendory; Or Ordentlich (COLT, 2022)

Blind Modulo Analog-to-Digital Conversion of Vector Processes. - Amir Weiss; Everest W. Huang; Or Ordentlich; Gregory W. Wornell (ICASSP, 2022)

The Double-Sided Information Bottleneck Function. - Michael Dikshtein; Or Ordentlich; Shlomo Shamai (Shitz) (Entropy, 2022)

Strong Data Processing Constant Is Achieved by Binary Inputs. - Or Ordentlich; Yury Polyanskiy (IEEE Trans. Inf. Theory, 2022)

Blind Modulo Analog-to-Digital Conversion. - Amir Weiss; Everest W. Huang; Or Ordentlich; Gregory W. Wornell (IEEE Trans. Signal Process., 2022)

Minimax Risk Upper Bounds Based on Shell Analysis of a Quantized Maximum Likelihood Estimator. - Noam Gavish; Or Ordentlich (ISIT, 2023)

Bounds on the density of smooth lattice coverings. - Or Ordentlich; Oded Regev 001; Barak Weiss (CoRR, 2023)

Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining. - Uri Erez; Or Ordentlich; Shlomo Shamai (ISIT, 2024)

Memory Complexity of Entropy Estimation. - Tomer Berg; Or Ordentlich; Ofer Shayevitz (CoRR, 2024)

Optimal Quantization for Matrix Multiplication. - Or Ordentlich; Yury Polyanskiy (CoRR, 2024)

Statistical Inference With Limited Memory: A Survey. - Tomer Berg; Or Ordentlich; Ofer Shayevitz (IEEE J. Sel. Areas Inf. Theory, 2024)

Optimal Online Bookmaking for Binary Games. - Alankrita Bhatt; Or Ordentlich; Oron Sabag (CoRR, 2025)

NestQuant: Nested Lattice Quantization for Matrix Products and LLMs. - Semyon Savkin; Eitan Porat; Or Ordentlich; Yury Polyanskiy (CoRR, 2025)

High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables. - Iris Kaplan; Or Ordentlich (CoRR, 2025)

Memory Complexity of Estimating Entropy and Mutual Information. - Tomer Berg; Or Ordentlich; Ofer Shayevitz (IEEE Trans. Inf. Theory, 2025)

The Strong Data Processing Inequality Under the Heat Flow. - Bo'az Klartag; Or Ordentlich (IEEE Trans. Inf. Theory, 2025)

The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding. - Or Ordentlich (CoRR, 2025)