PUBLICATIONS

Conference Publications

Tomer Berg, Or Ordentlich and Ofer Shayevitz, "Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules", International Symposium on Information Theory 2020 (ISIT 2020). Jack Keil Wolf ISIT Best Student Paper Award. Watch Tomer's video presentation 

Ido Shahaf, Or Ordentlich and Gil Segev, "An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption", International Symposium on Information Theory 2020 (ISIT 2020). Watch Ido's video presentation 

Or Ordentlich and Ido Tal, "An Upgrading Algorithm with Optimal Power Law", Proceedings of the International Zurich Seminar on Information and Communication (IZS 2020), pp. 46, Zurich, Switzerland, February 2020

Dror Drach, Or Ordentlich and Ofer Shayevitz, "Maximal Correlation Under Quantization", Proceedings of the International Zurich Seminar on Information and Communication (IZS 2020), pp. 58, Zurich, Switzerland, February 2020

Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich and Ofer Shayevitz, "The Interactive Capacity of the Binary Symmetric Channel is at Least 1/40 the Shannon Capacity", Proceedings of the International Symposium on Information Theory (ISIT 2019), pp. 2868-2872, Paris, France, July 2019

Yuval Kochman, Or Ordentlich and Yury Polyanskiy, "A Lower Bound on the Expected Distortion of Joint Source-Channel Coding", Proceedings of the International Symposium on Information Theory (ISIT 2019), pp. 1332-1336, Paris, France, July 2019. [Slides]

Elad Romanov and Or Ordentlich, "Blind unwrapping of modulo reduced Gaussian vectors: Recovering MSBs from LSBs", Proceedings of the International Symposium on Information Theory (ISIT 2019), pp. 2329-2333, Paris, France, July 2019. [Slides]

Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy and Rüdiger Urbanke, "Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels", Proceedings of the International Symposium on Information Theory (ISIT 2018), pp. 311-315, Vail, CO, USA, June 2019

Or Ordentlich and Yury Polyanskiy, "Entropy Under Additive Bernoulli and Spherical Noises", Proceedings of the International Symposium on Information Theory (ISIT 2018), pp. 521-525, Vail, CO, USA, June 2019. [Slides]

Yuval Kochman, Or Ordentlich and Yury Polyanskiy, "Ozarow-Type Outer Bounds for Memoryless Sources and Channels", Proceedings of the International Symposium on Information Theory (ISIT 2018), pp. 1774-177, Vail, CO, USA, June 2019. [Slides]

 

W. Huleihel and O. Ordentlich, "How to quantize n outputs of a binary symmetric channel to n − 1 bits?", Proceedings of the International Symposium on Information Theory (ISIT 2017), pp. 91-95, Aachen, Germany, June 2017

B. Nazer, O. Ordentlich and Y. Polyanskiy, "Information-distilling quantizers", Proceedings of the International Symposium on Information Theory (ISIT 2017), pp. 96-1002, Aachen, Germany, June 2017. [Slides

O. Ordentlich and Y. Polyanskiy, "Low complexity schemes for the random access Gaussian channel", Proceedings of the International Symposium on Information Theory (ISIT 2017), pp. 2528-2532, Aachen, Germany, June 2017. [Extended VersionSlides]

Bobak Nazer and Or Ordentlich, "Diophantine Approximation for Network Information Theory: A Survey of Old and New Results", Proceedings of the 54th Annual Allerton Conference on Communication, Control, and Computing, pp. 990-996, Monticello, Illinois, Sep. 2016 (invited paper).

Or Ordentlich, Ofer Shayevitz and Omri Weinstein, "An improved upper bound for the most informative boolean function conjecture", Proceedings of the International Symposium on Information Theory (ISIT 2016), pp. 500-504, Barcelona, Spain, July 2016. [Slides​]

Or Ordentlich, "Novel Lower Bounds on the Entropy Rate of Binary Hidden Markov Processes", Proceedings of the International Symposium on Information Theory (ISIT 2016), pp. 690-694, Barcelona, Spain, July 2016. [Slides]

 

Or Ordentlich and Uri Erez, "Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM", Proceedings of the International Symposium on Information Theory (ISIT 2015), pp. 321-325, Hong Kong, June 2015. [Slides]

Or Ordentlich and Ofer Shayevitz, "A VC-dimension-based Outer Bound on the Zero-Error Capacity of the Binary Adder Channel", Proceedings of the International Symposium on Information Theory (ISIT 2015), pp. 2366-2370, Hong Kong, June 2015. [Slides]

Or Ordentlich, Uri Erez and Bobak Nazer, "On Compute-and-Forward with Feedback", Proceedings of the IEEE Information Theory Workshop (ITW 2015), invited paper, Jerusalem, Israel, April 2015. [Slides]

Or Ordentlich and Ofer Shayevitz,"Subset-Universal Lossy Compression", Proceedings of the IEEE Information Theory Workshop (ITW 2015), Jerusalem, Israel, April 2015. [Slides]

Or Ordentlich and Uri Erez, "Integer-Forcing Source Coding", Proceedings of the International Symposium on Information Theory (ISIT 2014), pp. 181-185, Honolulu, HI, USA, July 2014. [Slides]

Or Ordentlich and Ofer Shayevitz,"Bounding Techniques for the Intrinsic Uncertainty of Channels",

Proceedings of the International Symposium on Information Theory (ISIT 2014), pp. 3082-3086, Honolulu, HI, USA, July 2014. [Slides]

Or Ordentlich, Uri Erez and Bobak Nazer, "Successive Integer-Forcing and its Sum-Rate Optimality",

Proceedings of the 51st Annual Allerton Conference on Communication, Control, and Computing, pp. 282-292, Monticello, Illinois, Oct. 2013. [Slides]

 

Or Ordentlich and Uri Erez, "Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap" Proceedings of the IEEE Information Theory Workshop (ITW 2013), pp. 298–302, Seville, Spain, Sep. 2013. [Slides]

Or Ordentlich and Uri Erez, "A Simple Proof for the Existence of ``Good'' Pairs of Nested Lattices",

Proceedings of the 27th Annual Convention of Electrical and Electronic Engineers in Israel, Eilat, pp. 1-12 Israel, Nov. 2012. [Slides]

Anatoly Khina, Or Ordentlich, Uri Erez, Yuval Kochman and Gregory W. Wornell, "Decode-and-Forward for the Gaussian Relay Channel via Standard AWGN Coding and Decoding", Proceedings of the Information Theory Workshop (ITW 2012), pp. 462–466, Lausanne, Switzerland, Sep. 2012.

Or Ordentlich, Uri Erez and Bobak Nazer, "The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel", Proceedings of the International Symposium on Information Theory (ISIT 2012), pp. 2072-2076, Cambridge, MA, USA, July 2012. [Slides]

Or Ordentlich, Uri Erez and Bobak Nazer, "The Compute-and-Forward Transform",

Proceedings of the International Symposium on Information Theory (ISIT 2012), pp. 3008–3012, Cambridge, MA, USA, July 2012.

Or Ordentlich and Uri Erez, "Interference Alignment at Finite SNR for Time-Invariant Channels",

Proceedings of the Information Theory Workshop (ITW 2011), pp. 442–446, Paraty, Brazil, Oct. 2011. [Slides]

Or Ordentlich, Jiening Zhan, Uri Erez, Michael Gastpar and Bobak Nazer, "Practical Code Design for Compute-and-Forward", Proceedings of the International Symposium on Information Theory (ISIT 2011),

pp. 1876–1880, St. Petersburg, Russia, Aug. 2011. [Slides]

Or Ordentlich and Uri Erez, "Achieving The Gains Promised by Integer-Forcing Equalization with Binary Codes", Proceedings of the 26th Annual Convention of Electrical and Electronic Engineers in Israel,

pp. 703–707, Eilat, Israel, Nov. 2010.

Jiening Zhan, Bobak Nazer, Or Ordentlich, Uri Erez and Michael Gastpar, "Integer-Forcing Architectures for MIMO: Distributed Implementation and SIC", Proceedings of the 44th Asilomar conference on

Signals, Systems and Computers, pp. 322–326, Pacific Grove, CA, Nov. 7-10, 2010.

Or Ordentlich and Uri Erez, "Cyclic-Coded Integer-Forcing Equalization", Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing, pp. 474-478, Monticello, Illinois, Sep. 2010. [Slides]





 

Or Ordentlich and Yury Polyanskiy, "Strong Data Processing Constant is Achieved by Binary Inputs", Submitted September 2020

Elad Romanov, Tamir Bendory and Or Ordentlich, "Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition", Submitted July 2020

Or Ordentlich, Oded Regev and Barak Weiss, "New Bounds on the Density of Lattice Coverings", Submitted June 2020. [Slides]

Or Ordentlich and Ido Tal, "An Upgrading Algorithm with Optimal Power Law", Submitted March 2020

Assaf Ben-Yishai, Young-Han Kim, Or Ordentlich and Ofer Shayevitz, "A Lower Bound on the Interactive Capacity of Binary Memoryless Symmetric Channels", Submitted Sept. 2019

Alankrita Bhatt, Bobak Nazer, Or Ordentlich and Yury Polyanskiy, "Information-Distilling Quantizers", Submitted Dec. 2018, revised Oct. 2019

Elad Romanov and Or Ordentlich, "Blind unwrapping of modulo reduced Gaussian vectors: Recovering MSBs from LSBs", Submitted, Jan. 2019

Or Ordentlich, Yury Polyanskiy and Ofer Shayevitz, "A Note on the Probability of Rectangles for Correlated Binary Strings", Accepted to IEEE Transactions on Information Theory, Aug. 2020

Yuval Kochman, Or Ordentlich and Yury Polyanskiy, "A Lower Bound on the Expected Distortion of Joint Source-Channel Coding", IEEE Transactions on Information Theory, vol. 66, no. 8, pp. 4722-4741, Aug. 2020

Elad Romanov and Or Ordentlich, "Above the Nyquist Rate, Modulo Folding Does Not Hurt"IEEE Signal Processing Letters, vol. 26 , no. 8, pp. 1167 - 1171, Aug. 2019

Or Ordentlich and Uri Erez, "Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality with DPCM", IEEE Transactions on Information Theory, vol. 65, no. 2, pp. 1153-1164, Feb. 2019

Or Ordentlich, Gizem Tabak, Pavan Kumar Hanumolu, Andrew C Singer and Gregory W Wornell, "A Modulo-Based Architecture for Analog-to-Digital Conversion", IEEE Journal of Selected Topics in Signal Processing, vol. 12, no. 5, pp. 825 - 840, Oct. 2018

Or Ordentlich and Uri Erez, "Integer-Forcing Source Coding", IEEE Transactions on Information Theory, vol. 63, no. 2, pp. 1253-1269, Feb. 2017

Yanjun Han, Or Ordentlich and Ofer Shayevitz, "Mutual Information Bounds via Adjacency Events", IEEE Transactions on Information Theory, vol. 62, no. 11, pp. 6068-6080, Nov. 2016.

Or Ordentlich and Uri Erez, "A Simple Proof for the Existence of ``Good'' Pairs of Nested Lattices"

IEEE Transactions on Information Theory, vol. 62, no. 8, pp. 4439-4453, Aug. 2016

Or Ordentlich and Ofer Shayevitz, "An Upper Bound on the Sizes of Multiset-Union-Free Families", SIAM Journal on Discrete Mathematics, vol. 30, issue 2, pp. 1032-1045, May 2016

Or Ordentlich and Ofer Shayevitz, "Minimum MS. E. Gerber's Lemma", IEEE Transactions on Information Theory, vol. 61, no. 11, pp. 5883-5891, Nov. 2015

Or Ordentlich and Uri Erez, "Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap", IEEE Transactions on Information Theory, vol. 61, no. 1, pp. 323-340, Jan. 2015

Or Ordentlich, Uri Erez and Bobak Nazer, "The Approximate Sum Capacity of the Symmetric Gaussian K-User Interference Channel", IEEE Transactions on Information Theory, vol. 60, no. 6, pp. 3450-3482, June 2014

Or Ordentlich and Uri Erez, "On the Robustness of Lattice Interference Alignment", IEEE Transactions on Information Theory, vol. 59, no. 5, pp. 2735-2759, May 2013

Or Ordentlich and Uri Erez, "Cyclic-Coded Integer-Forcing Equalization", IEEE Transactions on Information Theory, vol. 58, no. 9, pp. 5804-5815, Sept. 2012

Journal Publications and Preprints
Book Chapters

 

Bobak Nazer and Or Ordentlich, "Characterizing the Performance of Wireless Communication Architectures via Basic Diophantine Approximation Bounds", Number Theory meets Wireless Communication, Springer, forthcoming.

The Science & 

Mathematics University

© 2023 by Scientist Personal. Proudly created with Wix.com

  • Facebook Clean Grey
  • Twitter Clean Grey
  • LinkedIn Clean Grey