Or Ordentlich - RankMe

124 papers A* 4A 1B 34Misc 1Journal 81Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	High-Rate Quantized Matrix Multiplication: Theory and Practice. CoRR Or Ordentlich, Yury Polyanskiy
2026	J	`jnl`	Optimal Quantization for Matrix Multiplication. IEEE Trans. Inf. Theory Or Ordentlich, Yury Polyanskiy
2026	J	`jnl`	Price of universality in vector quantization is at most 0.11 bit. CoRR Alina Harbuzova, Or Ordentlich, Yury Polyanskiy
2026	J	`jnl`	The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding. IEEE Trans. Inf. Theory Or Ordentlich
2026	J	`jnl`	WaterSIC: information-theoretically (near) optimal linear layer quantization. CoRR Egor Lifar, Semyon Savkin, Or Ordentlich, Yury Polyanskiy
2025	B	`conf`	High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables. ISIT Iris Kaplan, Or Ordentlich
2025	J	`jnl`	High-Rate Nested-Lattice Quantized Matrix Multiplication with Small Lookup Tables. CoRR Iris Kaplan, Or Ordentlich
2025	J	`jnl`	Memory Complexity of Estimating Entropy and Mutual Information. IEEE Trans. Inf. Theory Tomer Berg, Or Ordentlich, Ofer Shayevitz
2025	J	`jnl`	NestQuant: Nested Lattice Quantization for Matrix Products and LLMs. CoRR Semyon Savkin, Eitan Porat, Or Ordentlich, Yury Polyanskiy
2025	A*	`conf`	NestQuant: nested lattice quantization for matrix products and LLMs. ICML Semyon Savkin, Eitan Porat, Or Ordentlich, Yury Polyanskiy
2025	B	`conf`	Optimal Online Bookmaking for Binary Games. ISIT Alankrita Bhatt, Or Ordentlich, Oron Sabag
2025	J	`jnl`	Optimal Online Bookmaking for Binary Games. CoRR Alankrita Bhatt, Or Ordentlich, Oron Sabag
2025	B	`conf`	Optimal Quantization for Matrix Multiplication. ISIT Or Ordentlich, Yury Polyanskiy
2025	J	`jnl`	The Strong Data Processing Inequality Under the Heat Flow. IEEE Trans. Inf. Theory Bo'az Klartag, Or Ordentlich
2025	J	`jnl`	The Voronoi Spherical CDF for Lattices and Linear Codes: New Bounds for Quantization and Coding. CoRR Or Ordentlich
2024	B	`conf`	Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining. ISIT Uri Erez, Or Ordentlich, Shlomo Shamai
2024	J	`jnl`	Lower Bounds on Mutual Information for Linear Codes Transmitted over Binary Input Channels, and for Information Combining. CoRR Uri Erez, Or Ordentlich, Shlomo Shamai
2024	J	`jnl`	Memory Complexity of Entropy Estimation. CoRR Tomer Berg, Or Ordentlich, Ofer Shayevitz
2024	J	`jnl`	Optimal Quantization for Matrix Multiplication. CoRR Or Ordentlich, Yury Polyanskiy
2024	J	`jnl`	Statistical Inference With Limited Memory: A Survey. IEEE J. Sel. Areas Inf. Theory Tomer Berg, Or Ordentlich, Ofer Shayevitz
2024	J	`jnl`	The strong data processing inequality under the heat flow. CoRR Bo'az Klartag, Or Ordentlich
2023	J	`jnl`	Bounds on the density of smooth lattice coverings. CoRR Or Ordentlich, Oded Regev, Barak Weiss
2023	B	`conf`	Minimax Risk Upper Bounds Based on Shell Analysis of a Quantized Maximum Likelihood Estimator. ISIT Noam Gavish, Or Ordentlich
2023	J	`jnl`	Statistical Inference with Limited Memory: A Survey. CoRR Tomer Berg, Or Ordentlich, Ofer Shayevitz
2022	Misc	`conf`	Blind Modulo Analog-to-Digital Conversion of Vector Processes. ICASSP Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell
2022	J	`jnl`	Blind Modulo Analog-to-Digital Conversion. IEEE Trans. Signal Process. Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell
2022	J	`jnl`	Deterministic Finite-Memory Bias Estimation. CoRR Tomer Berg, Or Ordentlich, Ofer Shayevitz
2022	A*	`conf`	On The Memory Complexity of Uniformity Testing. COLT Tomer Berg, Or Ordentlich, Ofer Shayevitz
2022	J	`jnl`	On The Memory Complexity of Uniformity Testing. CoRR Tomer Berg, Or Ordentlich, Ofer Shayevitz
2022	A*	`conf`	On the Role of Channel Capacity in Learning Gaussian Mixture Models. COLT Elad Romanov, Tamir Bendory, Or Ordentlich
2022	J	`jnl`	On the Role of Channel Capacity in Learning Gaussian Mixture Models. CoRR Elad Romanov, Tamir Bendory, Or Ordentlich
2022	A	`conf`	Spiked Covariance Estimation from Modulo-Reduced Measurements. AISTATS Elad Romanov, Or Ordentlich
2022	J	`jnl`	Strong Data Processing Constant Is Achieved by Binary Inputs. IEEE Trans. Inf. Theory Or Ordentlich, Yury Polyanskiy
2022	J	`jnl`	The Double-Sided Information Bottleneck Function. Entropy Michael Dikshtein, Or Ordentlich, Shlomo Shamai (Shitz)
2021	J	`jnl`	A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels. IEEE Trans. Inf. Theory Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz
2021	J	`jnl`	An Upgrading Algorithm With Optimal Power Law. IEEE Trans. Inf. Theory Or Ordentlich, Ido Tal
2021	B	`conf`	Binary Maximal Correlation Bounds and Isoperimetric Inequalities via Anti-Concentration. ISIT Dror Drach, Or Ordentlich, Ofer Shayevitz
2021	J	`jnl`	Blind Modulo Analog-to-Digital Conversion of Vector Processes. CoRR Amir Weiss, Everest W. Huang, Or Ordentlich, Gregory W. Wornell
2021	J	`jnl`	Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs. IEEE Trans. Inf. Theory Elad Romanov, Or Ordentlich
2021	B	`conf`	Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss. ISIT Assaf Ben-Yishai, Or Ordentlich
2021	J	`jnl`	Constructing Multiclass Classifiers using Binary Classifiers Under Log-Loss. CoRR Assaf Ben-Yishai, Or Ordentlich
2021	B	`conf`	Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. ISIT Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby
2021	J	`jnl`	Critical Slowing Down Near Topological Transitions in Rate-Distortion Problems. CoRR Shlomi Agmon, Etam Benger, Or Ordentlich, Naftali Tishby
2021	A*	`conf`	Deterministic Finite-Memory Bias Estimation. COLT Tomer Berg, Or Ordentlich, Ofer Shayevitz
2021	J	`jnl`	Information-Distilling Quantizers. IEEE Trans. Inf. Theory Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy
2021	J	`jnl`	Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition. SIAM J. Math. Data Sci. Elad Romanov, Tamir Bendory, Or Ordentlich
2021	J	`jnl`	On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel. CoRR Elad Romanov, Or Ordentlich
2021	J	`jnl`	On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel. Entropy Elad Romanov, Or Ordentlich
2021	J	`jnl`	Spiked Covariance Estimation from Modulo-Reduced Measurements. CoRR Elad Romanov, Or Ordentlich
2021	B	`conf`	The Double-Sided Information-Bottleneck Function. ISIT Michael Dikshtein, Or Ordentlich, Shlomo Shamai Shitz
2020	J	`jnl`	A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. IEEE Trans. Inf. Theory Yuval Kochman, Or Ordentlich, Yury Polyanskiy
2020	J	`jnl`	A Note on the Probability of Rectangles for Correlated Binary Strings. IEEE Trans. Inf. Theory Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz
2020	B	`conf`	An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. ISIT Ido Shahaf, Or Ordentlich, Gil Segev
2020	J	`jnl`	An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. CoRR Ido Shahaf, Or Ordentlich, Gil Segev
2020	J	`jnl`	An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. IACR Cryptol. ePrint Arch. Ido Shahaf, Or Ordentlich, Gil Segev
2020	J	`jnl`	An Upgrading Algorithm with Optimal Power Law. CoRR Or Ordentlich, Ido Tal
2020	B	`conf`	Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. ISIT Tomer Berg, Or Ordentlich, Ofer Shayevitz
2020	J	`jnl`	Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules. CoRR Tomer Berg, Ofer Shayevitz, Or Ordentlich
2020	J	`jnl`	Multi-reference alignment in high dimensions: sample complexity and phase transition. CoRR Elad Romanov, Tamir Bendory, Or Ordentlich
2020	J	`jnl`	New bounds on the density of lattice coverings. CoRR Or Ordentlich, Oded Regev, Barak Weiss
2020	J	`jnl`	Strong data processing constant is achieved by binary inputs. CoRR Or Ordentlich, Yury Polyanskiy
2019	B	`conf`	A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. ISIT Yuval Kochman, Or Ordentlich, Yury Polyanskiy
2019	J	`jnl`	A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. CoRR Yuval Kochman, Or Ordentlich, Yury Polyanskiy
2019	J	`jnl`	A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels. CoRR Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz
2019	J	`jnl`	A Note on the Probability of Rectangles for Correlated Binary Strings. CoRR Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz
2019	J	`jnl`	Above the Nyquist Rate, Modulo Folding Does Not Hurt. CoRR Elad Romanov, Or Ordentlich
2019	J	`jnl`	Above the Nyquist Rate, Modulo Folding Does Not Hurt. IEEE Signal Process. Lett. Elad Romanov, Or Ordentlich
2019	B	`conf`	Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. ISIT Elad Romanov, Or Ordentlich
2019	J	`jnl`	Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs from LSBs. CoRR Elad Romanov, Or Ordentlich
2019	J	`jnl`	Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM. IEEE Trans. Inf. Theory Or Ordentlich, Uri Erez
2019	B	`conf`	The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity. ISIT Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich, Ofer Shayevitz
2018	J	`jnl`	A Modulo-Based Architecture for Analog-to-Digital Conversion. CoRR Or Ordentlich, Gizem Tabak, Pavan Kumar Hanumolu, Andrew C. Singer, Gregory W. Wornell
2018	J	`jnl`	A Modulo-Based Architecture for Analog-to-Digital Conversion. IEEE J. Sel. Top. Signal Process. Or Ordentlich, Gizem Tabak, Pavan Kumar Hanumolu, Andrew C. Singer, Gregory W. Wornell
2018	B	`conf`	Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. ISIT S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke
2018	J	`jnl`	Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. CoRR S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke
2018	B	`conf`	Entropy Under Additive Bernoulli and Spherical Noises. ISIT Or Ordentlich, Yury Polyanskiy
2018	J	`jnl`	Information-Distilling Quantizers. CoRR Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy
2018	B	`conf`	Ozarow- Type Outer Bounds for Memoryless Sources and Channels. ISIT Yuval Kochman, Or Ordentlich, Yury Polyanskiy
2017	J	`jnl`	How to Quantize n Outputs of a Binary Symmetric Channel to n-1 Bits? CoRR Wasim Huleihel, Or Ordentlich
2017	B	`conf`	How to quantize n outputs of a binary symmetric channel to n - 1 bits? ISIT Wasim Huleihel, Or Ordentlich
2017	B	`conf`	Information-distilling quantizers. ISIT Bobak Nazer, Or Ordentlich, Yury Polyanskiy
2017	J	`jnl`	Integer-Forcing Source Coding. IEEE Trans. Inf. Theory Or Ordentlich, Uri Erez
2017	B	`conf`	Low complexity schemes for the random access Gaussian channel. ISIT Or Ordentlich, Yury Polyanskiy
2016	J	`jnl`	A Simple Proof for the Existence of "Good" Pairs of Nested Lattices. IEEE Trans. Inf. Theory Or Ordentlich, Uri Erez
2016	J	`jnl`	An Upper Bound on the Sizes of Multiset-Union-Free Families. SIAM J. Discret. Math. Or Ordentlich, Ofer Shayevitz
2016	B	`conf`	An improved upper bound for the most informative boolean function conjecture. ISIT Or Ordentlich, Ofer Shayevitz, Omri Weinstein
2016	—	`conf`	Diophantine approximation for network information theory: A survey of old and new results. Allerton Bobak Nazer, Or Ordentlich
2016	J	`jnl`	Mutual Information Bounds via Adjacency Events. IEEE Trans. Inf. Theory Yanjun Han, Or Ordentlich, Ofer Shayevitz
2016	J	`jnl`	Novel Lower Bounds on the Entropy Rate of Binary Hidden Markov Processes. CoRR Or Ordentlich
2016	B	`conf`	Novel lower bounds on the entropy rate of binary hidden Markov processes. ISIT Or Ordentlich
2015	B	`conf`	A VC-dimension-based outer bound on the zero-error capacity of the binary adder channel. ISIT Or Ordentlich, Ofer Shayevitz
2015	J	`jnl`	Dictatorship is the Most Informative Balanced Function at the Extremes. CoRR Or Ordentlich, Ofer Shayevitz, Omri Weinstein
2015	J	`jnl`	Dictatorship is the Most Informative Balanced Function at the Extremes. Electron. Colloquium Comput. Complex. Or Ordentlich, Ofer Shayevitz, Omri Weinstein
2015	J	`jnl`	Minimum MS. E. Gerber's Lemma. CoRR Or Ordentlich, Ofer Shayevitz
2015	J	`jnl`	Minimum MS. E. Gerber's Lemma. IEEE Trans. Inf. Theory Or Ordentlich, Ofer Shayevitz
2015	J	`jnl`	Mutual Information Bounds via Adjacency Events. CoRR Or Ordentlich, Ofer Shayevitz
2015	B	`conf`	On compute-and-forward with feedback. ITW Or Ordentlich, Uri Erez, Bobak Nazer
2015	J	`jnl`	Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM. CoRR Or Ordentlich, Uri Erez
2015	B	`conf`	Performance analysis and optimal filter design for sigma-delta modulation via duality with DPCM. ISIT Or Ordentlich, Uri Erez
2015	J	`jnl`	Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap. IEEE Trans. Inf. Theory Or Ordentlich, Uri Erez
2015	B	`conf`	Subset-universal lossy compression. ITW Or Ordentlich, Ofer Shayevitz
2014	J	`jnl`	A VC-dimension-based Outer Bound on the Zero-Error Capacity of the Binary Adder Channel. CoRR Or Ordentlich, Ofer Shayevitz
2014	J	`jnl`	An Upper Bound on the Sizes of Multiset-Union-Free Families. CoRR Or Ordentlich, Ofer Shayevitz
2014	B	`conf`	Bounding techniques for the intrinsic uncertainty of channels. ISIT Or Ordentlich, Ofer Shayevitz
2014	B	`conf`	Integer-Forcing source coding. ISIT Or Ordentlich, Uri Erez
2014	J	`jnl`	Is There a Proficiency-Universal Language? CoRR Or Ordentlich, Ofer Shayevitz
2014	J	`jnl`	The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel. IEEE Trans. Inf. Theory Or Ordentlich, Uri Erez, Bobak Nazer
2013	J	`jnl`	Integer-Forcing Source Coding. CoRR Or Ordentlich, Uri Erez
2013	J	`jnl`	On the Robustness of Lattice Interference Alignment. IEEE Trans. Inf. Theory Or Ordentlich, Uri Erez
2013	J	`jnl`	Precoded Integer-Forcing Equalization Universally Achieves the MIMO Capacity up to a Constant Gap CoRR Or Ordentlich, Uri Erez
2013	B	`conf`	Precoded integer-forcing universally achieves the MIMO capacity to within a constant gap. ITW Or Ordentlich, Uri Erez
2013	J	`jnl`	Successive Integer-Forcing and its Sum-Rate Optimality. CoRR Or Ordentlich, Uri Erez, Bobak Nazer
2013	—	`conf`	Successive integer-forcing and its sum-rate optimality. Allerton Or Ordentlich, Uri Erez, Bobak Nazer
2012	J	`jnl`	A Simple Proof for the Existence of "Good" Pairs of Nested Lattices CoRR Or Ordentlich, Uri Erez
2012	J	`jnl`	Cyclic-Coded Integer-Forcing Equalization. IEEE Trans. Inf. Theory Or Ordentlich, Uri Erez
2012	B	`conf`	Decode-and-forward for the Gaussian relay channel via standard AWGN coding and decoding. ITW Anatoly Khina, Or Ordentlich, Uri Erez, Yuval Kochman, Gregory W. Wornell
2012	J	`jnl`	The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel CoRR Or Ordentlich, Uri Erez, Bobak Nazer
2012	B	`conf`	The approximate sum capacity of the symmetric Gaussian K-user interference channel. ISIT Or Ordentlich, Uri Erez, Bobak Nazer
2012	B	`conf`	The compute-and-forward transform. ISIT Or Ordentlich, Uri Erez, Bobak Nazer
2011	J	`jnl`	Interference Alignment at Finite SNR CoRR Or Ordentlich, Uri Erez
2011	B	`conf`	Interference alignment at finite SNR for time-invariant channels. ITW Or Ordentlich, Uri Erez
2011	B	`conf`	Practical code design for compute-and-forward. ISIT Or Ordentlich, Jiening Zhan, Uri Erez, Michael Gastpar, Bobak Nazer
2010	—	`conf`	Cyclic coded integer-forcing equalization. Allerton Or Ordentlich, Uri Erez
2010	J	`jnl`	Cyclic-Coded Integer-Forcing Equalization CoRR Or Ordentlich, Uri Erez