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.展开更多
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.展开更多
In this paper,we have established some noiseless coding theorems for a generalized parametric‘useful’inaccuracy measure of orderαand typeβand generalized mean codeword length.Further,lower bounds on exponentiated ...In this paper,we have established some noiseless coding theorems for a generalized parametric‘useful’inaccuracy measure of orderαand typeβand generalized mean codeword length.Further,lower bounds on exponentiated useful code length for the best 1:1 code have been obtained in terms of the useful inaccuracy of orderαand typeβand the generalized average useful codeword length.展开更多
文摘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.
文摘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.
文摘In this paper,we have established some noiseless coding theorems for a generalized parametric‘useful’inaccuracy measure of orderαand typeβand generalized mean codeword length.Further,lower bounds on exponentiated useful code length for the best 1:1 code have been obtained in terms of the useful inaccuracy of orderαand typeβand the generalized average useful codeword length.
