- 期刊
ON CODING THEOREM CONNECTED WITH 'USEFUL' ENTROPY OF ORDER - β
摘要
Guiasu and Picard [I] introduced the mean length for 'useful' codes. They called this length as the 'useful' mean length. Longo [2] has proved a noiseless coding theorem for this 'useful' mean length. In this paper we will give two generalizations of 'useful' mean length. After then the noiseless coding theorems are proved using these two generalizations.
延伸閱讀
- Li, Z. Y., Wang, Y. L., & Tan, F. G. (2012). The Solution of a Class of Third-Order Boundary Value Problems by the Reproducing Kernel Method. Abstract and Applied Analysis, 2012(), 1411-1421. https://doi.org/10.1155/2012/195310
- Kumar, S., Ram, G., & Gupta, V. (2012). Some Coding Theorems for Nonadditive Generalized Mean-Value Entropies. International Journal of Mathematics and Mathematical Sciences, 2012(), 550-559-040. https://doi.org/10.1155/2012/315686
- Wan, H., He, A., You, Z., & Zhao, X. (2014). Formal Proof of a Machine Closed Theorem in Coq. Journal of Applied Mathematics, 2014(), 916-924-886. https://doi.org/10.1155/2014/892832
- AMIRI, H. A., & FERNANDO, T. S. (1990). ON CLOSE-TO-CONVEX FUNCTIONS OF COMPLEX ORDER. International Journal of Mathematics and Mathematical Sciences, 1990(), 321-330. https://doi.org/10.1155/S0161171290000473
- Huang, P. H., Tsai, Y. T., & Tang, C. Y. (2006). A Near-Quadratic Algorithm for the Alpha-Connected Two-Center Problem. Journal of Information Science and Engineering, 22(6), 1317-1324. https://doi.org/10.6688/JISE.2006.22.6.1