Publications

Recent Papers

S. Kheradmand, M. Khosravifard, S. J. Zahabi and H. Narimani, Improved Upper Bounds on the Average Redundancy of Optimal RVLC, To be published in  IEEE Trans. Communications, 2024.

S. J. Zahabi, H. Narimani and  M. Khosravifard, On the Shortest Codeword of the Optimal RVLC,  IEEE Trans. Information Theory, Vol. 69, No. 7, pp. 4740-4745, July 2023.

IEEE Transactions on Information Theory

13- S. J. Zahabi, H. Narimani and  M. Khosravifard, On the Shortest Codeword of the Optimal RVLC,  IEEE Trans. Information Theory, Vol. 69, No. 7, pp. 4740-4745, July 2023.

12- M. Javad-Kalbasi and M. Khosravifard, Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes,  IEEE Trans. Information Theory, Vol. 66, No. 7, pp. 4419-4430, July 2020.

11- H. Narimani and M. Khosravifard, A New Code for Encoding All Monotone Sources with a Fixed Large Alphabet Size,   IEEE Trans. Information Theory, Vol. 66, No. 3, pp. 1474-1481, March 2020.

10- A. Aghajan and M. Khosravifard, Optimal Codes with Limited Kraft Sum,   IEEE Trans. Information Theory, Vol. 61, No. 11, pp. 6385-6394, Nov. 2015.

9- S. Kheradmand, M. Khosravifard and T.A. Gulliver, The Redundancy of an Optimal Binary Fix-free Code Is not Greater than 1 Bit,  IEEE Trans. Information Theory, Vol. 61, No. 6, pp. 3549-3558, June 2015.

8- S. J. Zahabi and M. Khosravifard, On the Penalty of Optimal Fix-Free Codes, IEEE Trans. Information Theory, Vol. 61, No. 5, pp. 2776-2787, May 2015.

7- A. Aghajan and M. Khosravifard, Weakly-Symmetric Fix-Free Codes,  IEEE Trans. Information Theory, Vol. 60, No. 9, pp. 5500-5515, Sept. 2014.

6- H. Narimani and M. Khosravifard, Huffman Redundancy for Large Alphabet Sources, IEEE Trans. Information Theory, Vol. 60, No. 3, pp. 1412-1427, Mar. 2014.

5- A. Aghajan and M. Khosravifard, 93% of the 3/4-Conjecture Is Already Verified,  IEEE Trans. Information Theory, Vol. 59, No. 12, pp. 8182-8194, Dec. 2013.

4- H. Narimani, M. Khosravifard and T.A. Gulliver, How Suboptimal is the Shannon Code?, IEEE Trans. Information Theory, Vol. 59, No. 1, pp. 458-471, Jan. 2013.

3- M. Khosravifard and S. Kheradmand, Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes, IEEE Trans. Information Theory, Vol. 58, No. 6, pp. 4049-4057, June. 2012.

2- M. Khosravifard, H. Halabian and T.A. Gulliver, A Kraft-Type Sufficient Condition for the Existence of D-ary Fix-free Codes, IEEE Trans. Information Theory, Vol. 56, No. 6, pp. 2920-2927, June. 2010.

 1- M. Khosravifard, H. Saidi, M. Esmaeili and T.A. Gulliver, The Minimum Average Code for Finite Memoryless Monotone Sources, IEEE Trans. Information Theory, Vol. 53, No. 3, pp. 955-975, Mar. 2007.

IEEE Transactions on Communications

4- S. Kheradmand, M. Khosravifard, S. J. Zahabi and H. Narimani, Improved Upper Bounds on the Average Redundancy of Optimal RVLC, To be published in  IEEE Trans. Communications, 2024.

3- S. J. Zahabi and M. Khosravifard, The Most Likely Optimal Symmetric RVLC,  IEEE Trans. Communications, Vol. 63, No. 11, pp. 4142-4149, Nov. 2015.

2- S. J. Zahabi, A. Aghajan and M. Khosravifard, Sequentially-Constructible Reversible Variable Length Codes,  IEEE Trans. Communications, Vol. 62, No. 8, pp. 2605-2614, Aug. 2014.

1- M. Khosravifard, H. Narimani and T.A. Gulliver, A Simple Recursive Shannon Code, IEEE Trans. Communications, vol. 60, no. 2, pp. 295-299, Feb. 2012.

Other IEEE Transactions 

2- P. Rastegari, M. Khosravifard, H. Narimani and T.A. Gulliver, On the Structure of the Minimum Average Redundancy Code for Monotone Sources, IEEE Communications Letters, Vol. 18, No. 4, pp. 664-667, Apr. 2014.

1- A. Rezvanifar, M. Khosravifard, Including the Size of Regions in Image Segmentation by Region-Based Graph,  IEEE Trans. Image Processing, Vol. 23, No. 2, pp. 635-644, Feb. 2014.