English

应用科学学报 ›› 1990, Vol. 8 ›› Issue (1): 25-30.

• 论文 • 上一篇    下一篇

极大前缀码的性质及其计数

杨耀池1, 邱伟德2   

  1. 1. 上海市普陀区业余大学;
    2. 上海工业大学
  • 收稿日期:1987-11-04 修回日期:1988-07-05 出版日期:1990-03-31 发布日期:1990-03-31

THE PROPERTIES OF MAXIMAL PREFIX CODES AND ENUMERATION

YANG YUECHI1, QIU WEIDE2   

  1. 1. The Spare-Time University of Pu Tuo District in Shanghai;
    2. Shanghai University of Technolgy
  • Received:1987-11-04 Revised:1988-07-05 Online:1990-03-31 Published:1990-03-31

PDF

98

被引次数

5

摘要： 本文提出和证明极大前缀码的性质,证明了全体极大前缀码在语言连接运算下构成自由么半群.对有限极大前缀码的个数给出选推式:Gm表示所有最大字长不超过m的极大前缀码的个数,有Gm=1+Gm-1n,其中n是字母表X的字母个数.

Abstract: The properties of maximal prefix codes are established in this paper. We prove that tho family of maximal prefix codes forms a free monoid under the language concatenation, operation.
A recurrence formula for tho number of finite maximal prefix codes is given as follows:
Let Gm denote the number of maximal prefix codes in which the length of words is equal to m or less than it, we have then
Gm=1+Gm-1n
Where n is the number of letters of alphabet X.