Mohammadali Khosravifard

Orcid: 0000-0002-0645-7285

According to our database1, Mohammadali Khosravifard authored at least 31 papers between 2002 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Improved Upper Bounds on the Average Redundancy of Optimal RVLC.
IEEE Trans. Commun., May, 2024

2023
On the Shortest Codeword of the Optimal RVLC.
IEEE Trans. Inf. Theory, July, 2023

2020
A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size.
IEEE Trans. Inf. Theory, 2020

Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes.
IEEE Trans. Inf. Theory, 2020

2015
On the Penalty of Optimal Fix-Free Codes.
IEEE Trans. Inf. Theory, 2015

The Redundancy of an Optimal Binary Fix-Free Code Is Not Greater Than 1 bit.
IEEE Trans. Inf. Theory, 2015

Optimal Codes With Limited Kraft Sum.
IEEE Trans. Inf. Theory, 2015

The Most Likely Optimal Symmetric RVLC.
IEEE Trans. Commun., 2015

On the source-channel separation theorem for infinite source alphabets.
Probl. Inf. Transm., 2015

2014
Huffman Redundancy for Large Alphabet Sources.
IEEE Trans. Inf. Theory, 2014

Weakly Symmetric Fix-Free Codes.
IEEE Trans. Inf. Theory, 2014

Including the Size of Regions in Image Segmentation by Region-Based Graph.
IEEE Trans. Image Process., 2014

Sequentially-Constructible Reversible Variable Length Codes.
IEEE Trans. Commun., 2014

On the Structure of the Minimum Average Redundancy Code for Monotone Sources.
IEEE Commun. Lett., 2014

A note on the redundancy of reversible variable length codes.
Proceedings of the Iran Workshop on Communication and Information Theory, 2014

2013
Bounds on Throughput of CSMA in Weibull Fading Channels.
IEEE Wirel. Commun. Lett., 2013

How Suboptimal Is the Shannon Code?
IEEE Trans. Inf. Theory, 2013

93% of the $ {{ 3}\over { 4}}$-Conjecture Is Already Verified.
IEEE Trans. Inf. Theory, 2013

2012
Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes.
IEEE Trans. Inf. Theory, 2012

A Simple Recursive Shannon Code.
IEEE Trans. Commun., 2012

2011
Signal Activity Detection of Offset-QPSK in Colored Gaussian Noise.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Near-Optimality of the Minimum Average Redundancy Code for Almost All Monotone Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

2010
A Kraft-type sufficient condition for the existence of D-ary fix-free codes.
IEEE Trans. Inf. Theory, 2010

2009
Extension of the Lasserre-Avrachenkov theorem on the integral of multilinear forms over simplices.
Appl. Math. Comput., 2009

Two recursive versions of the Shannon code.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Improving the Performance of LP Decoders for Cyclic Codes.
Proceedings of IEEE International Conference on Communications, 2009

2007
The Minimum Average Code for Finite Memoryless Monotone Sources.
IEEE Trans. Inf. Theory, 2007

Confliction of the Convexity and Metric Properties in <i>f</i>-Divergences.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

2006
The Average Performance of the Minimax Code.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2003
A Tree Based Algorithm for Generating All Possible Binary Compact Codes with <i>N</i> Codewords.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2002
The minimum average code for finite memoryless monotone sources.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002


  Loading...