Mohammadali Khosravifard

IEEE Trans. Commun., May, 2024

2023

On the Shortest Codeword of the Optimal RVLC.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2023

2020

A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes.

[BibT_eX]

[DOI]

Mohammad Javad-Kalbasi

IEEE Trans. Inf. Theory, 2020

2015

On the Penalty of Optimal Fix-Free Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

The Redundancy of an Optimal Binary Fix-Free Code Is Not Greater Than 1 bit.

[BibT_eX]

[DOI]

Shima Kheradmand

IEEE Trans. Inf. Theory, 2015

Optimal Codes With Limited Kraft Sum.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

The Most Likely Optimal Symmetric RVLC.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2015

On the source-channel separation theorem for infinite source alphabets.

[BibT_eX]

[DOI]

Probl. Inf. Transm., 2015

2014

Huffman Redundancy for Large Alphabet Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Weakly Symmetric Fix-Free Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Including the Size of Regions in Image Segmentation by Region-Based Graph.

[BibT_eX]

[DOI]

Alireza Rezvanifar

IEEE Trans. Image Process., 2014

Sequentially-Constructible Reversible Variable Length Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2014

On the Structure of the Minimum Average Redundancy Code for Monotone Sources.

[BibT_eX]

[DOI]

Parvin Rastegari

IEEE Commun. Lett., 2014

A note on the redundancy of reversible variable length codes.

[BibT_eX]

[DOI]

Proceedings of the Iran Workshop on Communication and Information Theory, 2014

2013

Bounds on Throughput of CSMA in Weibull Fading Channels.

[BibT_eX]

[DOI]

Naghmeh Sadat Moayedian

Sonia Aïssa

IEEE Wirel. Commun. Lett., 2013

How Suboptimal Is the Shannon Code?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

93% of the $ {{ 3}\over { 4}}$-Conjecture Is Already Verified.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2012

Some Upper Bounds on the Redundancy of Optimal Binary Fix-Free Codes.

[BibT_eX]

[DOI]

Shima Kheradmand

IEEE Trans. Inf. Theory, 2012

A Simple Recursive Shannon Code.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2012

2011

Signal Activity Detection of Offset-QPSK in Colored Gaussian Noise.

[BibT_eX]

[DOI]

AliAkbar Tadaion

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

Near-Optimality of the Minimum Average Redundancy Code for Almost All Monotone Sources.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011

2010

A Kraft-type sufficient condition for the existence of D-ary fix-free codes.

[BibT_eX]

[DOI]

Hassan Halabian

IEEE Trans. Inf. Theory, 2010

2009

Extension of the Lasserre-Avrachenkov theorem on the integral of multilinear forms over simplices.

[BibT_eX]

[DOI]

Appl. Math. Comput., 2009

Two recursive versions of the Shannon code.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Improving the Performance of LP Decoders for Cyclic Codes.

[BibT_eX]

[DOI]

M. R. Heidarpour

Mahmoud Modarres-Hashemi

Proceedings of IEEE International Conference on Communications, 2009

2007

The Minimum Average Code for Finite Memoryless Monotone Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Confliction of the Convexity and Metric Properties in <i>f</i>-Divergences.

[BibT_eX]

[DOI]

Dariush Fooladivanda

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2007

2006

The Average Performance of the Minimax Code.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

2002

The minimum average code for finite memoryless monotone sources.

[BibT_eX]

[DOI]

Mohammadali Esmaeili