Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities

Stevens P.

首页> 外文期刊>IEEE Transactions on Information Theory >Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities

【24h】

Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities

机译：BCH解码算法的扩展，以解码二进制循环码，直至达到其最大纠错能力

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

The BCH algorithm is extended to correct more errors than indicated by the BCH bound. In the first step of the decoding procedure, a number of errors corresponding to a particular case of the Hartmann-Tzeng bound are corrected. In the second step full error correction is the goal. A measure for the worst-case number of field elements of an extension field GF(2/sup m/) that must be tested for this purpose is given for binary cyclic linear unequal error protection codes as well as for conventional binary cyclic codes.

机译：扩展了BCH算法，以纠正比BCH边界指示的错误更多的错误。在解码过程的第一步，校正对应于Hartmann-Tzeng边界的特定情况的许多错误。在第二步中，目标是完全纠错。对于二进制循环线性不等差错保护码以及常规的二进制循环码，给出了为此目的必须测试的扩展场GF（2 / sup m /）的场元的最坏情况的度量。

著录项

来源
《IEEE Transactions on Information Theory》 |1988年第5期|P.1332-1340|共9页
作者
Stevens P.;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类无线电电子学、电信技术;
关键词

相似文献

外文文献
中文文献
专利

1. Algebraic decoding beyond e/sub BCH/ of some binary cyclic codes, when e [J] . Bours P., Janssen J.C.M. IEEE Transactions on Information Theory . 1990,第1期

机译：当e
2. A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code [J] . Shah, T., Khan, M., De Andrade, A.A. Anais da Academia Brasileira de Ciências . 2013,第3期

机译：通过（n + 1）n个长度的二进制循环码对n个长度的二进制BCH码进行解码的方法
3. A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code [J] . Antonio A. De Andrade, Mubashar Khan, Tariq Shah Anais da Academia Brasileira de Ciencias . 2013,第3期

机译：通过（n + 1）n个长度的二进制循环码对n个长度的二进制BCH码进行解码的方法
4. Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Grobner bases [C] . Daniel Augot, Magali Bardet, Jean-Charles Faugere IEEE International Symposium on Information Theory . 2003

机译：使用Grebner基础的代码的校正容量高效地解码（二进制）循环代码
5. The maximum -likelihood decoding algorithms of low-density codes over binary erasure channels [D] . Lee, Ki-Moon 2007

机译：二进制擦除信道上低密度码的最大似然解码算法
6. A Parallel Decoding Algorithm for Short Polar Codes Based on Error Checking and Correcting [O] . Yingxian Zhang, Xiaofei Pan, Kegang Pan, -1

机译：基于错误检查和纠正的短极化码并行解码算法
7. A decoding method of an n length binary BCH code through (n + 1)n length binary cyclic code [O] . Shah, Tariq, Khan, Mubashar, De Andrade, Antonio Aparecido [UNESP] 2013

机译：通过（n + 1）n个长度的二进制循环码对n个长度的二进制BCH码进行解码的方法
8. Hardware Analysis of the Fundamental Iterative Algorithm for Decoding A (17,9)Binary BCH Code [R] . Campbell, R. L. 1996

机译：解码a（17,9）二进制BCH码的基本迭代算法的硬件分析

Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities

摘要

著录项

相似文献

相关主题

期刊订阅