共查询到17条相似文献,搜索用时 250 毫秒
1.
2.
BCH码是目前最为常用的纠错码之一,我国的数字电视广播地面传输标准DTMB也使用了缩短的BCH码作为前向纠错编码的外码。针对该BCH码的特点,采用BM译码算法,设计了一种实时译码器。与其它设计方案相比较,显著减少了占用逻辑数量。整个设计在Stratix II FPGA上进行了综合验证,满足了设计要求。 相似文献
3.
Delsarte在文献[1]中建立了广义RS码的子域子码,它既包括了BCH码,广义BCH码,也包括了Goppa码,并得出最小距离下限扩张的一般定理。为了充分利用广义RS码的子域子码的纠错能力,设计广义RS码的子域子码的超设计距离译码器是十分有意义的。本文指出,用解线性方程组的方法可实现对广义RS码的子域子码的超距离译码。从而,BCH码、GBCH码、Goppa码的超距离译码问题一起被解决了。 相似文献
4.
本文讨论的是q元狭义本原BCH码,以下简称BCH码。首先给出了一定条件下求BCH码维数的一般公式,该结果改进了MacWilliams等人(1977)的结果。然后给出了求BCH码维数的一般迭代方法。此外,本文还指出了BCH码的最小距离的BCH界是分圆陪集首,我们猜测BCH码的最小距离也是分圆陪集首。 相似文献
5.
6.
BCH码是一种获得广泛应用的能够纠正多个错码的循环码。介绍了BCH编码原理,基于FPGA,利用VHDL硬件描述语言实现了一个BCH(15,11)码编码器。给出了仿真结果。仿真结果表明,达到了预期的设计要求,并用于实际项目中。 相似文献
7.
8.
BCH(31,21)码的解码及其软件实现 总被引:4,自引:0,他引:4
从实用的角度论述了BCH(31,21)码的解码原理。利用计算出的伴随式s1和s3判定BCH(31,21)码的错误并纠正。从编程角度提出了便于计算伴随式的方法,最后给出了用C51实现该解码的程序代码。 相似文献
9.
本文研究了几类线性分组码C[n,k,d]的网格图复杂度s(C)。给出并证明了码长为奇数的两类线性分组码的网格图复杂度。同时得出了有关可纠t个错的本原BCH码[2^m-1,2^m-1-mt]及其扩展本在BCH码的网格图复杂度的若干结论。从而避免了必须先寻找码的直和结构才可得到码的网格图复杂度的较好上界。 相似文献
10.
11.
Salah A. Aly Andreas Klappenecker Pradeep Kiran Sarvepalli 《IEEE transactions on information theory / Professional Technical Group on Information Theory》2007,53(3):1183-1188
Classical Bose-Chaudhuri-Hocquenghem (BCH) codes that contain their (Euclidean or Hermitian) dual codes can be used to construct quantum stabilizer codes; this correspondence studies the properties of such codes. It is shown that a BCH code of length n can contain its dual code only if its designed distance delta=O(radicn), and the converse is proved in the case of narrow-sense codes. Furthermore, the dimension of narrow-sense BCH codes with small design distance is completely determined, and - consequently - the bounds on their minimum distance are improved. These results make it possible to determine the parameters of quantum BCH codes in terms of their design parameters 相似文献
12.
《IEEE transactions on information theory / Professional Technical Group on Information Theory》1985,31(6):769-780
Binary primitive BCH codes form a large class of powerful error-correcting codes. The weight distributions of primitive BCH codes are unknown except for some special classes, such as the single, double, triple error-correcting codes and some very low-rate primitive BCH codes. However, asymptotic results for the weight distribution of a large subclass of primitive BCH codes have been derived by Sidel'nikov. These results provide some insight into the weight structure of primitive BCH codes. Sidel'nikov's approach is improved and applied to the weight distribution of any binary linear block code. Then Sidel'nikov's results on the weight distributions of binary primitive BCH codes are improved and it is shown that the weights of a binary primitive code have approximate binomial distribution. 相似文献
13.
14.
15.
《电子科学学刊(英文版)》1996,(3)
In this paper, only narrow-sense primitive BCH codes over GF(q) are considered. A formula, that can be used in many cases, is first presented for computing the dimension of BCH codes. It improves the result given by MacWilliams and Sloane in 1977. A new method for finding the dimension of all types of BCH codes is proposed. In second part, it is proved that the BCH bound is the leader of some cyclotomic coset, and we guess that the minimum distance for any BCH code is also the leader of some cyclotomic coset. 相似文献
16.
17.
In this paper, only narrow-sense primitive BCH codes over GF(q) are considered. A formula, that can be used in many cases, is first presented for computing the dimension of BCH codes.
It improves the result given by MacWilliams and Sloane in 1977. A new method for finding the dimension of all types of BCH
codes is proposed. In second part, it is proved that the BCH bound is the leader of some cyclotomic coset, and we guess that
the minimum distance for any BCH code is also the leader of some cyclotomic coset.
Supported by the National Natural Science Foundation of China 相似文献