Improved Upper Bounds on the Average Redundancy of Optimal RVLC
S Kheradmand, M Khosravifard… - IEEE Transactions …, 2024 - ieeexplore.ieee.org
It is shown that efficient reversible variable length codes (RVLCs) with numerous codewords
can be obtained if suboptimal RVLCs for the average distributions of monotone sources with …
can be obtained if suboptimal RVLCs for the average distributions of monotone sources with …
Performance analysis of source coding techniques
SV Viraktamath, MV Koti… - 2017 International …, 2017 - ieeexplore.ieee.org
In this paper the performance of different source coding techniques is analyzed by
considering same set of probabilities for all the algorithms for binary, tertiary and …
considering same set of probabilities for all the algorithms for binary, tertiary and …
Huffman redundancy for large alphabet sources
H Narimani, M Khosravifard - IEEE Transactions on information …, 2013 - ieeexplore.ieee.org
The performance of optimal prefix-free encoding for memoryless sources with a large
alphabet size is studied. It is shown that the redundancy of the Huffman code for almost all …
alphabet size is studied. It is shown that the redundancy of the Huffman code for almost all …
On the penalty of optimal fix-free codes
SJ Zahabi, M Khosravifard - IEEE Transactions on Information …, 2015 - ieeexplore.ieee.org
In this paper, the difference between the redundancy of the optimal asymmetric/symmetric fix-
free code, and that of the optimal prefix-free code is considered as the penalty of benefiting …
free code, and that of the optimal prefix-free code is considered as the penalty of benefiting …
Binary code optimization
P Gharehbagheri, SHHS Javadi, P Asghari… - arXiv preprint arXiv …, 2021 - arxiv.org
This article shows that any type of binary data can be defined as a collection from
codewords of variable length. This feature helps us to define an Injective and surjective …
codewords of variable length. This feature helps us to define an Injective and surjective …
The most likely optimal symmetric RVLC
SJ Zahabi, M Khosravifard - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
The Most Likely Optimal Symmetric RVLC Page 1 4142 IEEE TRANSACTIONS ON
COMMUNICATIONS, VOL. 63, NO. 11, NOVEMBER 2015 The Most Likely Optimal …
COMMUNICATIONS, VOL. 63, NO. 11, NOVEMBER 2015 The Most Likely Optimal …
A new code for encoding all monotone sources with a fixed large alphabet size
H Narimani, M Khosravifard - IEEE Transactions on Information …, 2020 - ieeexplore.ieee.org
The problem of designing a fixed code for encoding all monotone sources with a large
alphabet size n is studied. It is proved that if the code-lengths of a code sequence are of …
alphabet size n is studied. It is proved that if the code-lengths of a code sequence are of …