助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   burst error correcting 在 电信技术 分类中 的翻译结果: 查询用时:0.492秒
图标索引 在分类学科中查询
所有学科
电信技术
更多类别查询

图标索引 历史查询
 

burst error correcting
相关语句
  纠突发错误
    Burst Error Correcting Abilities for Maximum Length Code and Generalized First Order Reed-Muller Code
    极长码及推广的一阶Reed—MuIIer码的纠突发错误能力
短句来源
    Using the fact that the first order generalized Reed-Muller code is a code combined by simple repetition code and Maximum Length code, the burst error correcting ability of Reed-Muller code is given.
    又利用推广的一阶Reed-Muller码是极长码及重复码的组合,求出推广的一阶Reed-Muller码的纠突发错误能力。
短句来源
    Using the fact that Maximum Length code is a set of m sequencies and dual code of a Hamming code, the burst error correcting ability of Maximum Length code is derived.
    本文利用极长码实际上是m序列,且是汉明码的对偶码,从而推导出该码的纠突发错误能力的一个限。
短句来源
    It is pointed out that these two codes have the same random error correcting abilities and almost the same burst error correcting abilities.
    并指出,Reed-Muller码的纠突发错误能力与极长码很接近,都具有相同的纠随机错误能力,且都是大数逻辑可译码。
短句来源
  “burst error correcting”译为未确定词的双语例句
    Burst error correcting performance analysis of BCH codesinterleaving in wireless burst channels
    无线突发信道中抗突发错误BCH码交织编码的性能分析
短句来源
    In this paper,the idea of two-way supervised Complex codes is proposed,random and burst error correcting capabilities are analyzed.
    本文提出双向监督复数旋转码的概念,并对其纠错能力进行了分析。
短句来源
查询“burst error correcting”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  burst error correcting
A method is presented for the construction of binary linear burst error correcting recurrent codes of type B2, viz.
      
We would like to investigate the use of error control coding in key design, in particular the use of burst error correcting codes.
      
The BCH code can be adapted towards the burst error correcting capabilities and this will be shown in the contribution.
      
This code provides a practical alternative to the well known burst error correcting codes.
      
Such codes will be called complete burst error correcting codes.
      
更多          


A proof is presented for the existence of the optimum burst-error-correcting irreducible Goppa codes whose burst-error-correcting capabilities arbitrarily approach the Wyner-Ash bound and Sharma-Dass bound for very large n. On the basis of this result, the asymptote of the burst-error-correcting on these irreducible Goppa codes is discussed. The result is that the most parts of the irreducible Goppa codes over GF(qm) have the burst-correcting...

A proof is presented for the existence of the optimum burst-error-correcting irreducible Goppa codes whose burst-error-correcting capabilities arbitrarily approach the Wyner-Ash bound and Sharma-Dass bound for very large n. On the basis of this result, the asymptote of the burst-error-correcting on these irreducible Goppa codes is discussed. The result is that the most parts of the irreducible Goppa codes over GF(qm) have the burst-correcting capabilities n-k-nε/2≤b≤n-k/2, i. e. there are irreducible Goppa codes over GF (qm), whoseburst-correcting capabilities are able to approach the Wyner-Ash bound, but the asymptote of the burst-correcting capabilities for these Goppa codes is no good, i. e. b/n may possibly approach zero, when n→∞, and R remains constant.

本文证明了n充分大时,不仅存在有任意接近Sharma-Dass限的纠突发错误既约Goppa码,而且存在有任意接近Wyner-Ash限的最佳纠突发错误Goppa码,并且讨论了这类码的纠突发错误能力的渐近性。

The relation between the burst-error correctiog ability of the BCH codes and the roots of the BCH codes has not been solved well till now. A lower bound on the burst-error correcting ability of the usual BCH codes over GF(q) is presented in this paper. It is proved that the upper and lower bounds on the burst-error correcting ability b of the BCH codes over GF(q) (q=prime or power of prime) are d-2≤b≤[(n-k)/2] (Where [x] denotes the integer part of x). Thus the...

The relation between the burst-error correctiog ability of the BCH codes and the roots of the BCH codes has not been solved well till now. A lower bound on the burst-error correcting ability of the usual BCH codes over GF(q) is presented in this paper. It is proved that the upper and lower bounds on the burst-error correcting ability b of the BCH codes over GF(q) (q=prime or power of prime) are d-2≤b≤[(n-k)/2] (Where [x] denotes the integer part of x). Thus the relation between b and roots of the codes in derived for the first time.

循环码的根与纠突发错误能力之间的关系一直未能很好解决。本文证明了GF(q)上BCH码纠突发能力b的上、下限为:d-2≤b≤[(n-k)/2]。从而首次给出了码的根与纠突发能力之间的关系,并提供了一个构造纠突发错误循环码的极为简便和实用的新方法。

In the first part of this paper, a lower bound on the burst-error correcting ability b≥[(3d-5)/ 4] is given for cyclic codes. Then we proved the (23,12) Golay code can correct burst errors of length 5 or less. Finally, we show that the(24,12) code can correct burst errors of length 5 or less and simultaneously correct three random errors and detect a great many other error patterns.

本文用一个较简单的方法证明了二进制循环码纠突发错误能力b的下限为;b≥[(3d-5)/4]。用类似方法证明了(23,12)Golay码的b=5,并分析了它的扩张码(24,12)码能纠正三个随机错误同时纠正长度≤5的突发错误,及检测其它大量的错误图样,由此说明此码在实际差错控制系统中有着广泛的应用前途。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关burst error correcting的内容
在知识搜索中查有关burst error correcting的内容
在数字搜索中查有关burst error correcting的内容
在概念知识元中查有关burst error correcting的内容
在学术趋势中查有关burst error correcting的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社