分组码的几种码限的讨论  

Discussion on Several Code Limits of Block Codes

作　　者：冯天树[1] FENG Tianshu(Tianjin College of Beijing University of Science and Technology,Tianjin 301830,China)

机构地区：[1]北京科技大学天津学院,天津301830

出　　处：《通信技术》2021年第11期2459-2465,共7页Communications Technology

摘　　要：对信道编码中的分组码的汉明限、Plotkin限、Singleton限、Gilbert_Varshamov限四种距离限进行了讨论、比较和分析,说明了分组码达到这些限时的性质和构造方法。研究表明,要降低误码率达到香农极限,通过增加许用码组的最小码距起的作用是有限的,关键还是靠增加码长和构造新的编译码方法。该研究结果对编码工作者在构造达到香农极限的新码时提供参考。In this paper,several distance limits of block codes in channel coding:Hamming limit,Plotkin limit,Singleton limit and Gilbert_Varshamov limit are discussed and analyzed.The properties and construction methods of block codes when they reach these limits are explained,and these code limits are compared and analyzed.The conclusion is that in order to reduce the bit error rate and reach the Shannon limit,the role of increasing the minimum code distance of the allowable code group is limited.The key is to increase the code length and construct a new encoding and decoding method.It is hoped that it will be beneficial to code researcher in constructing new codes that reach the Shannon limit.

关 键 词：分组码 汉明限 Plotkin限 Singleton限 Gilbert_Varshamov限 

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