This paper describes an efficient coding method for Korean characters (alphabet) using a three-state transition graph. Parallel Hangul Dynamic Coding Method (PHDCM) compresses about 3.5 bits per Korean character compared with other coding techinques. When we ran the method on a MasPar machine, it achieved a 49.314-fold speedup with 64 processors having 10 million Korean characters
This is a preview of subscription content, log in to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
Knuth, Donald E.,Dynamic Huffman Coding, Journal of Algorithm,6,no. 2 (1985), 163–180.
Abramson, Roman,Information Theory and Coding, McGraw-Hill, 1963.
Akl, Selim G.,Parallel Sorting Algorithm Academic Press, 1985.
Bookstein, A and Klein, S. T.,Is Huffman Coding Dead, Proceedings of Data Compression, IEEE (1993), pp. 464.
Kim, K. T. andMin, Y. S.,A Study onthe Composition of Compact Code using OCM, Journal of KCI9,no. 3 (1984), pp. 103–107.
Kim, K. T. andMin, Y. S.,A Study on an Efficient Coding of Hanguel, Journal of KCI14,no. 6 (1987), 533–641.
S. Roman,Coding and Information Theory, Springer-Verlag, 1992.
About this article
Cite this article
Min, Y.S. Parallel dynamic coding method of Hangul text. Korean J. Com. & Appl. Math. 3, 157–167 (1996). https://doi.org/10.1007/BF03008898
AMS Mathematics Subject Classifications