| Confliction of the Convexity and Metric Properties in f-Divergences M Khosravifard, D Fooladivanda, TA Gulliver IEICE Transactions on Fundamentals of Electronics, Communications and …, 2007 | 34 | 2007 |
| The minimum average code for finite memoryless monotone sources M Khosravifard, H Saidi, M Esmaeili, TA Gulliver IEEE transactions on information theory 53 (3), 955-975, 2007 | 26 | 2007 |
| A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords M Khosravifard, M ESMAEILI, H SAIDI, TA Gulliver IEICE Transactions on Fundamentals of Electronics, Communications and …, 2003 | 17 | 2003 |
| Including the size of regions in image segmentation by region-based graph A Rezvanifar, M Khosravifard IEEE Transactions on Image Processing 23 (2), 635-644, 2013 | 11 | 2013 |
| Some upper bounds on the redundancy of optimal binary fix-free codes M Khosravifard, S Kheradmand IEEE Transactions on Information Theory 58 (6), 4049-4057, 2012 | 11 | 2012 |
| A Kraft-Type Sufficient Condition for the Existence of -Ary Fix-Free Codes M Khosravifard, H Halabian, TA Gulliver IEEE Transactions on Information Theory 56 (6), 2920-2927, 2010 | 10 | 2010 |
| Huffman Redundancy for Large Alphabet Sources H Narimani, M Khosravifard IEEE Transactions on Information Theory 60 (3), 1412-1427, 2014 | 8 | 2014 |
| 93% of the 3/4-Conjecture Is Already Verified A Aghajan, M Khosravifard IEEE Transactions on Information Theory 59 (12), 8182-8194, 2013 | 8 | 2013 |
| How suboptimal is the Shannon code? H Narimani, M Khosravifard, TA Gulliver IEEE transactions on information theory 59 (1), 458-471, 2012 | 7 | 2012 |
| Weakly-Symmetric Fix-Free Codes A Aghajan, M Khosravifard Information Theory, IEEE Transactions on 60 (9), 5500 - 5515, 2014 | 5 | 2014 |
| The supertree of the compact codes H Narimani, M Khosravifard 2008 International Symposium on Telecommunications, 649-655, 2008 | 5 | 2008 |
| Improved and smoothened upper bounds on the redundancy of the optimal fix-free code M Khosravifard, R Rashtchi 2006 IEEE Information Theory Workshop-ITW'06 Chengdu, 249-253, 2006 | 5 | 2006 |
| The redundancy of an optimal binary fix-free code is not greater than 1 bit S Kheradmand, M Khosravifard, TA Gulliver IEEE Transactions on Information Theory 61 (6), 3549-3558, 2015 | 4 | 2015 |
| Sequentially-Constructible Reversible Variable Length Codes S Zahabi, A Aghajan, M Khosravifard Communications, IEEE Transactions on 62 (8), 2605 - 2614, 2014 | 4 | 2014 |
| Near-optimality of the minimum average redundancy code for almost all monotone sources H Narimani, M Khosravifard, TA Gulliver IEICE Transactions on Fundamentals of Electronics, Communications and …, 2011 | 4 | 2011 |
| The minimum average code for finite memoryless monotone sources M Khosravifard, TA Gulliver, M Esmaeili, H Saidi Proceedings of the IEEE Information Theory Workshop, 135-138, 2002 | 4 | 2002 |
| Some tight lower bounds on the redundancy of optimal binary prefix-free and fix-free codes M Javad-Kalbasi, M Khosravifard IEEE Transactions on Information Theory 66 (7), 4419-4430, 2020 | 3 | 2020 |
| On the penalty of optimal fix-free codes SJ Zahabi, M Khosravifard IEEE Transactions on Information Theory 61 (5), 2776-2787, 2015 | 3 | 2015 |
| On the Structure of the Minimum Average Redundancy Code for Monotone Sources P Rastegari, M Khosravifard, H Narimani, T Gulliver Communications Letters, IEEE 18 (4), 664 - 667, 2014 | 3 | 2014 |
| The overall performance of the Shannon code M Khosravifard, M Razaviyayn, H Narimani, TA Gulliver 2008 International Symposium on Information Theory and Its Applications, 1-4, 2008 | 3 | 2008 |
Aaron GulliverDepartment of Electrical and Computer Engineering, University of VictoriaVerified email at ece.uvic.ca
