The minimum average code for finite memoryless monotone sources. - Mohammadali Khosravifard; T. Aaron Gulliver; Mohammadali Esmaeili; Hossein Saidi 001 (ITW, 2002)

A Tree Based Algorithm for Generating All Possible Binary Compact Codes with N Codewords. - Mohammadali Khosravifard; Morteza Esmaeili; Hossein Saidi 001; T. Aaron Gulliver (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

The Average Performance of the Minimax Code. - Mohammadali Khosravifard; Hossein Saidi 001; Morteza Esmaeili; T. Aaron Gulliver (ISIT, 2006)

Confliction of the Convexity and Metric Properties in f-Divergences. - Mohammadali Khosravifard; Dariush Fooladivanda; T. Aaron Gulliver (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007)

The Minimum Average Code for Finite Memoryless Monotone Sources. - Mohammadali Khosravifard; Hossein Saidi 001; Morteza Esmaeili; T. Aaron Gulliver (IEEE Trans. Inf. Theory, 2007)

Improving the Performance of LP Decoders for Cyclic Codes. - M. R. Heidarpour; Mahmoud Modarres-Hashemi; Mohammadali Khosravifard; T. Aaron Gulliver (ICC, 2009)

Two recursive versions of the Shannon code. - T. Aaron Gulliver; Hamed Narimani; Mohammadali Khosravifard (ISIT, 2009)

Extension of the Lasserre-Avrachenkov theorem on the integral of multilinear forms over simplices. - Mohammadali Khosravifard; Morteza Esmaeili; Hossein Saidi 001 (Appl. Math. Comput., 2009)

A Kraft-type sufficient condition for the existence of D-ary fix-free codes. - Mohammadali Khosravifard; Hassan Halabian; T. Aaron Gulliver (IEEE Trans. Inf. Theory, 2010)

Near-Optimality of the Minimum Average Redundancy Code for Almost All Monotone Sources. - Hamed Narimani; Mohammadali Khosravifard; T. Aaron Gulliver (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Signal Activity Detection of Offset-QPSK in Colored Gaussian Noise. - Sayed Jalal Zahabi; Mohammadali Khosravifard; AliAkbar Tadaion; T. Aaron Gulliver (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

A Simple Recursive Shannon Code. - Mohammadali Khosravifard; Hamed Narimani; T. Aaron Gulliver (IEEE Trans. Commun., 2012)

Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes. - Mohammadali Khosravifard; Shima Kheradmand (IEEE Trans. Inf. Theory, 2012)

93% of the $ {{ 3} over { 4}}$-Conjecture Is Already Verified. - Adel Aghajan; Mohammadali Khosravifard (IEEE Trans. Inf. Theory, 2013)

How Suboptimal Is the Shannon Code? - Hamed Narimani; Mohammadali Khosravifard; T. Aaron Gulliver (IEEE Trans. Inf. Theory, 2013)

Bounds on Throughput of CSMA in Weibull Fading Channels. - Sayed Jalal Zahabi; Naghmeh Sadat Moayedian; Mohammadali Khosravifard; Sonia Aïssa (IEEE Wirel. Commun. Lett., 2013)

A note on the redundancy of reversible variable length codes. - Sayed Jalal Zahabi; Mohammadali Khosravifard (IWCIT, 2014)

On the Structure of the Minimum Average Redundancy Code for Monotone Sources. - Parvin Rastegari; Mohammadali Khosravifard; Hamed Narimani; T. Aaron Gulliver (IEEE Commun. Lett., 2014)

Sequentially-Constructible Reversible Variable Length Codes. - Sayed Jalal Zahabi; Adel Aghajan; Mohammadali Khosravifard (IEEE Trans. Commun., 2014)

Including the Size of Regions in Image Segmentation by Region-Based Graph. - Alireza Rezvanifar; Mohammadali Khosravifard (IEEE Trans. Image Process., 2014)

Weakly Symmetric Fix-Free Codes. - Adel Aghajan; Mohammadali Khosravifard (IEEE Trans. Inf. Theory, 2014)

Huffman Redundancy for Large Alphabet Sources. - Hamed Narimani; Mohammadali Khosravifard (IEEE Trans. Inf. Theory, 2014)

On the source-channel separation theorem for infinite source alphabets. - Adel Aghajan; Sayed Jalal Zahabi; Mohammadali Khosravifard; T. Aaron Gulliver (Probl. Inf. Transm., 2015)

The Most Likely Optimal Symmetric RVLC. - Sayed Jalal Zahabi; Mohammadali Khosravifard (IEEE Trans. Commun., 2015)

Optimal Codes With Limited Kraft Sum. - Adel Aghajan; Mohammadali Khosravifard (IEEE Trans. Inf. Theory, 2015)

The Redundancy of an Optimal Binary Fix-Free Code Is Not Greater Than 1 bit. - Shima Kheradmand; Mohammadali Khosravifard; T. Aaron Gulliver (IEEE Trans. Inf. Theory, 2015)

On the Penalty of Optimal Fix-Free Codes. - Sayed Jalal Zahabi; Mohammadali Khosravifard (IEEE Trans. Inf. Theory, 2015)

Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes. - Mohammad Javad-Kalbasi; Mohammadali Khosravifard (IEEE Trans. Inf. Theory, 2020)

A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size. - Hamed Narimani; Mohammadali Khosravifard (IEEE Trans. Inf. Theory, 2020)

On the Shortest Codeword of the Optimal RVLC. - Sayed Jalal Zahabi; Hamed Narimani; Mohammadali Khosravifard (IEEE Trans. Inf. Theory, 2023)

Improved Upper Bounds on the Average Redundancy of Optimal RVLC. - Shima Kheradmand; Mohammadali Khosravifard; Sayed Jalal Zahabi; Hamed Narimani (IEEE Trans. Commun., 2024)