BM译码算法的实现

本文提出了一种硬件实现BM算法的有效的串行结构，可以用于BCH和RS码的译码，采用无逆运算Berlekamp-Massey算法，不仅消除了有限域的逆运算，而且可以简化硬件设计。     

纠两个错的二进制BCH码新译码算法

对码长n=2^m-1纠两个错误的二进制BCH码，本文介绍了一种新的step-by-step译码算法。译码算法能直接确定接收的比特是否正确而不需要知道接收矢量的错误数目，也不需要知道相应的错误位置多项式。基于这种译码算法的译码器的优点在于占用硬件资源最少，实现简单快速。此外，这种译码方法特别适合于长码。     

一种在图像中嵌入有意义文本信息的新型鲁棒水印算法

提出了一种在图像小波域中嵌入文字的新型鲁棒水印算法,并对嵌入的文字进行混沌加密和BCH纠错编码。实验结果表明,该算法增大了水印数据的嵌入容量,提高了抗常见攻击的能力。     

可配置参数的BCH编解码器的设计

介绍了参数化的BCH编解码器的设计,并用verilog HDL实现。可由外部端口输入信号配置编码参数,以适应各种通信环境,达到最佳的数据传输率。工作时钟频率为500MHz。     

Covering Radius 1985–1994

 We survey important developments in the theory of covering radius during the period 1985–1994. We present lower bounds, constructions and upper bounds, the linear and nonlinear cases, density and asymptotic results, normality, specific classes of codes, covering radius and dual distance, tables, and open problems. Received October 28, 1994; revised version May 28, 1996     

On the Covering Radius of Long 5-ary BCH Codes with Minimum Distance 7

 We study S. D. Cohen’s method of estimating the covering radius of long primitive non-binary BCH codes with prime field alphabet. As an application we show that the covering radius is at most 7 for long 5-ary BCH codes with minimum distance seven. Received: November 13, 1996; revised version: March 11, 1997     

有限域上非本原BCH码的对偶包含判定

 循环陪集在经典和量子纠错编码理论中具有非常重要的作用.根据CSS编码定理知,利用经典BCH码构造量子BCH码时需要判断经典BCH码是否包含其对偶码.本文给出了循环陪集的若干重要性质,根据这些性质得到了判断有限域上非本原BCH码是否包含其对偶码的准则.本文给出的判断准则时间复杂度为多项式的,并且该判断准则对本原BCH码也适用.     

语音寻呼中关键技术及系统容量的研究

本文讨论了语音寻呼的实现方法和关键技术，分析了语音寻呼系统的几个主要参数及走向实用化的途径，给出了文本和语音综合的寻呼系统的容量方程，在理论分析的基础上提出了一个码率为２４００ｂｉｔ／ｓ的与ＰＯＣＳＡＧ码兼容的实验综合寻呼系统。文中的理论和方法同样适用甚至更有利于应用到ＦＬＥＸ或ＥＲＭＥＳ等高速寻呼系统中     

Analysis and performance evaluation of new coding options for space telecommand links – part II: jamming channels

In this paper, we study the performance of telecommand space links affected by pulsed, continuous wave and pseudo‐noise jamming. Countermeasures include coding, interleaving, and direct sequence spread spectrum. Binary and non‐binary low‐density parity‐check codes, parallel turbo codes, and soft‐decision decoded BCH codes are considered. We investigate the impact of different decoding algorithms, also taking into account the role of jamming state information, spreading processing gain and interleaving. The results show that significant gains (up to more than 10 dB) can be achieved in a number of interesting scenarios. Copyright © 2014 John Wiley & Sons, Ltd.