期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
Optimum Probability Distribution for Minimum Redundancy of Source Coding
1
作者 Om Parkash Priyanka Kakkar 《Applied Mathematics》 2014年第1期96-105,共10页
In the present communication, we have obtained the optimum probability distribution with which the messages should be delivered so that the average redundancy of the source is minimized. Here, we have taken the case o... In the present communication, we have obtained the optimum probability distribution with which the messages should be delivered so that the average redundancy of the source is minimized. Here, we have taken the case of various generalized mean codeword lengths. Moreover, the upper bound to these codeword lengths has been found for the case of Huffman encoding. 展开更多
关键词 mean codeword length Uniquely Decipherable Code Kraft’s INEQUALITY Entropy OPTIMUM Probability DISTRIBUTION ESCORT DISTRIBUTION Source Coding
下载PDF
An Algorithm to Generate Probabilities with Specified Entropy
2
作者 Om Parkash Priyanka Kakkar 《Applied Mathematics》 2015年第12期1968-1976,共9页
The present communication offers a method to determine an unknown discrete probability distribution with specified Tsallis entropy close to uniform distribution. The relative error of the distribution obtained has bee... The present communication offers a method to determine an unknown discrete probability distribution with specified Tsallis entropy close to uniform distribution. The relative error of the distribution obtained has been compared with the distribution obtained with the help of mathematica software. The applications of the proposed algorithm with respect to Tsallis source coding, Huffman coding and cross entropy optimization principles have been provided. 展开更多
关键词 ENTROPY Source Coding Kraft’s INEQUALITY HUFFMAN CODE mean codeword length Uniquely Decipherable CODE
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部