Abstract
This paper gives an algorithm to determine a discrete distribution with specified entropy. Givenn andH n , the entropy, the distribution found is close to a discrete finite uniform distribution. Finally, the relative errors of the distribution found using this algorithm are compared to the ones of the discrete distribution obtained from the Lagrange multipliers method.
Similar content being viewed by others
References
Chung, K-L. (1997). Efficient Huffman Decoding. Information Processing Letters 61, 97–99.
Guiasu, S. (1977). Information Theory with Applications. McGraw Hill, New York.
Huffman, D. A. (1952). A Method for the Construction of Minimum-redundancy Codes. Proceedings IRE 40 (Sept. 1952), 1098–1101.
Swaszek, P. F. and Wali, S. (2000). Generating Probabilities with a Specified Entropy. Journal of the Franklin Institute vol. 337 (2–3), 97–103.
Wali, S. (1997). Generating Discrete Memoryless Sources for Testing Variable Length Codes. M. S. E. E. thesis, Department of Electrical Engineering, University of Rhode Island.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Trandafir, R. Determination of a discrete distribution with given entropy. Oper Res Int J 3, 41–46 (2003). https://doi.org/10.1007/BF02940277
Issue Date:
DOI: https://doi.org/10.1007/BF02940277