arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1210.7906cs.ITmath.IT
收藏

BCH码的分析综合

Synthesis-by-analysis of BCH Codes

Atta Ul Mustafa, Ghulam Murtaza

摘要:

本文提出了一种BCH码生成多项式的盲综合方法。所提出的技术涉及到寻找不同的码字和块长度之间的最大公因子(GCD)。在此基础上,通过组合GCD计算,求出相关值,对于一个有效的块长度,迭代GCD计算的结果要么是生成多项式,要么是它的一些高阶倍数。这些高阶多项式在模2运算下被因式分解,并且所得到的因子之一总是进一步增加相关值的生成多项式。不同多项式的相关性图显示了正确的块长度和有效的生成多项式的非常高的值。已知有效块长度和生成多项式,包括奇偶校验位数(n-k)、最小距离dmin和纠错能力t的所有其他参数都容易暴露。

英文摘要:

In this paper we propose a technique to blindly synthesize the generator polynomial of BCH codes. The proposed technique involves finding Greatest Common Divisor (GCD) among different codewords and block lengths. Based on this combinatorial GCD calculation, correlation values are found. For a valid block length, the iterative GCD calculation results either into generator polynomial or some of its higher order multiples. These higher order polynomials are factorized under modulo-2 operation, and one of the resulting factors is always the generator polynomial which further increases the correlation value. The resulting correlation plot for different polynomials shows very high values for correct block length and valid generator polynomial. Knowing the valid block length and generator polynomial, all other parameters including number of parity-check digits (n-k), minimum distance dmin and error correcting capability t are readily exposed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑