一种快速判断非唯一可译码的方法  

A Fast Approach to Discriminate The Non-unique Decodable Code

作　　者：邢楠[1] 朱虹[1] 梁秀梅[1] 侯浩录[1] 

机构地区：[1]西安理工大学自动化与信息工程学院,西安710048

出　　处：《无线通信技术》2008年第2期29-31,共3页Wireless Communication Technology

摘　　要：本文介绍了一种快速判断非唯一可译码的方法,该方法针对现存判别唯一可译码的方法(即:根据异前缀码来进行判断的方法以及A.A.Sardinas和G.W.patterson判断法)所存在的不确定性、大运算量等问题,提出一种方法对非唯一可译码作出准确判断。该方法具有判别简单,运算量小等特点,可以广泛应用于非唯一可译码的判断。该方法对于通信、信息论方面的研究具有一定的意义。This paper proposes a fast approach to discriminate the non -unique decodable code. Differing from two existing methods about this academic issue, namely the approach basing on unusual prefix code and the A. A. Sardinas and G. W. Patterson discrimination algorithm, the approach in this paper discriminates the non - unique decodable code exactly. It solves some of the problems of the prior two methods, such as uncertainty and mass calculation work. This method requires small amount of calculation and is easy to be employed, and therefore it is widely applicable to the discriminafion of non - unique decodable code. This paper to some extend provides contribution to the research on communications and information theory.

关 键 词：唯一可译码 克劳夫特不等式 异前缀码 A.A.Sardinas和G.W.Patterson判断法 

分 类 号：TN911[电子电信—通信与信息系统]