Some Regular Languages and Prefix Coding 


Vol. 30,  No. 2, pp. 1-9, Feb.  2005


PDF
  Abstract

Code is a set of words. If, for any pair of words in the code, one is not prefix of another, the code is called “Prefix(-Free) Code”. The prefix coding problem is, given n, to find an optimal code with the minimum-sum of lengths of n words. As a special case of this, we present a method to find, given language L in some specific classes of regular languages, an optimal code among prefix codes in L. We also show how the structure of optimal codes varies as n grows, using trees.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Golin and H. Na, "Some Regular Languages and Prefix Coding," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 2, pp. 1-9, 2005. DOI: .

[ACM Style]

Mordecai Golin and Hyeon-Suk Na. 2005. Some Regular Languages and Prefix Coding. The Journal of Korean Institute of Communications and Information Sciences, 30, 2, (2005), 1-9. DOI: .

[KICS Style]

Mordecai Golin and Hyeon-Suk Na, "Some Regular Languages and Prefix Coding," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 2, pp. 1-9, 2. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880