摘要
为了利用Ｌｙｎｃｈ－Ｄａｖｉｓｏｎ编码压缩多进制序列，提出了一种推广方法，该方法不再将信源序列划分成多个序列分别进行压缩，而是采用一种统一的算法直接对信源进行压缩处理，并证明了这种方法在渐进意义上可达到熵界．
For compressing the multiple signal sources by Lynch Davisson code, an extended method is presented.It is not necessary for the new method to split the original sources to two sequences any longer. It is showed that as the sequence length N approaches infinity, the number of code bits per symbol approaches the entropy of the statistically independent symbol source.
出处
《北京邮电大学学报》
EI
CAS
CSCD
北大核心
1999年第2期89-91,共3页
Journal of Beijing University of Posts and Telecommunications
基金
国家教委高等学校博士学科点专项科研基金
关键词
编码理论
信源编码
通用编码
coding theory
source coding
universal coding
