Full papers
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
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.
Conference papers
Or Ordentlich and Ofer Shayevitz, “Bounding Techniques for the Intrinsic Uncertainty of Channels”, Proceedings of the International Symposium on Information Theory (ISIT 2014), Honolulu, HI, USA, July 2014. (Slides)
Or Ordentlich, Ofer Shayevitz and Omri Weinstein, “An Improved Upper Bound for the Most Informative Boolean Function Conjecture”, Proceedings of the 2016 International Symposium on Information Theory (ISIT 2016). (Slides)
Or Ordentlich, “Novel Lower Bounds on the Entropy Rate of Binary Hidden Markov Processes”, Proceedings of the 2016 International Symposium on Information Theory (ISIT 2016). (Slides)
Wasim Huleihel and Or Ordentlich, “How to Quantize n Outputs of a Binary Symmetric Channel to n-1 Bits?” accepted for presentatiom in the International Symposium on Information Theory 2017
Bobak Nazer, Or Ordentlich and Yury Polyanskiy, “Information-Distilling Quantizers” accepted for presentatiom in the International Symposium on Information Theory 2017. Extended Vesrion is in preparation.