ISI Journal Papers

 

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.

 

M. Khosravifard, M. Esmaeili, H. Saidi and T.A. Gulliver, Encoding Finite Sources with Ranked Probabilities, International Journal of Electronics and Communications, Vol. 63, pp. 1035-1042, Dec. 2009.

 

M. Khosravifard, M. Esmaeili and H. Saidi, Extension of the Lasserre-Avrachenkov Theorem on the Integral of Multilinear Forms over Simplices, Applied Mathematics and Computation, Vol. 212, Issue 1, pp. 94-99, June 2009.

 

M. Khosravifard, D. Fooladivanda and T.A. Gulliver, Confliction of the Convexity and Metric Properties in f-divergences, IEICE Trans. Fundamentals, vol. E90-A, no. 9, pp. 1848-1853, Sept. 2007.

 

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.

 

M. Khosravifard, M. Esmaeili, H. Saidi and T.A. Gulliver, A tree based algorithm for generating all possible binary compact codes with N codewords, IEICE Trans. Fundamentals, Vol. E86-A, No. 10, pp. 2510-2516, Oct. 2003.

 

 

International Conference Papers

 

M. Khosravifard, H. Narimani and T.A. Gulliver, Two Recursive Versions of the Shannon Code, IEEE Int. Symposium on Information Theory, Seoul, Korea, pp.  209-213,  July 2009.

 

M.R. Heidarpour, M. Modarres-Hashemi, M. Khosravifard and T.A. Gulliver, Improving the Performance of LP Decoders for Cyclic Codes, Presented at the IEEE International Conference on Communications, Dresden, Germany, June 2009.

 

M. Khosravifard and T.A. Gulliver, On the Capability of the Harada-Kobayashi Algorithm in Finding Fix-Free Codewords, Proc. Int. Symposium on Information Theory and its  Applications, Auckland, New Zealand, pp. 128-131, Dec. 2008.

 

M. Khosravifard, M. Razaviyayn, H. Narimani and T.A. Gulliver, The Overall Performance of the Shannon Code , Proc. Int. Symposium on Information Theory and its  Applications, Auckland, New Zealand, pp. 118-121, Dec. 2008.

 

H. Narimani and M. Khosravifard, The Supertree of the Compact Codes, Proc. Int. Symposium on Telecommunications, Tehran, Iran, pp. 649-655, Aug. 2008.

 

H. Halabian, M. Khosravifard and T.A. Gulliver, Some Sufficient Conditions for the Existence of D-ary Fix-Free Codes, Proc. Int. ITG Conference on Source and Channel Coding, Germany, Jan. 2008.

 

M. Khosravifard and R. Rashtchi, Improved and Smoothened Upper Bounds on the Redundancy of the Optimal Fix-Free Code, Proc. IEEE Information Theory Workshop, Chengdu, China, pp. 249-253, Oct. 2006.

 

M. Khosravifard, D. Fooladivanda and T.A. Gulliver, Exceptionality of the Variational Distance, Proc. IEEE Information Theory Workshop, Chengdu, China, pp. 274-276, Oct. 2006.

 

M. Khosravifard, M. Esmaeili, H. Saidi and T.A. Gulliver, A Class of Average Distributions for Monotone Sources, Proc. Int. Symposium on Information Theory and its  Applications, Seoul, Korea,  pp. 172-176, Oct. 2006.

 

M. Khosravifard, H. Saidi, M. Esmaeili and T.A. Gulliver, The Average Performance of the Minimax Code, Proc. IEEE Int. Symposium on Information Theory, Seattle, USA,  pp. 587-591, July 2006.

 

M. Khosravifard, T.A. Gulliver, M. Esmaeili and H. Saidi, The Minimum Average Code for Finite Memoryless Monotone Sources, Proc. IEEE Information Theory Workshop, Bangalore, India, pp. 135-138, Oct. 2002.

 

M.A khosravifard ,M. Nasiri, Multivalue Match Length Function for Data Compression, Proc. Int. Symposium on Information theory, Soronto, Italy, pp. 345, June 2000.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

Publications