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

图标索引 历史查询
 

burst-error-correcting
相关语句
  纠突发错误
     Existence and Asymptote on the Optimum Burst-Error-Correcting Irreducible Goppa Codes
     最佳纠突发错误既约Goppa码的存在性与渐近性
短句来源
     Study and Implementation of Burst-Error-Correcting Algorithm for Reed-Solomon Codes
     RS码纠突发错误译码算法研究与实现
短句来源
     Burst-Error-Correcting Software Implementation in the Serial Communication of Single-Chip Microprocessor
     单片机串行通信中纠突发错误的软件实现
短句来源
     A new encoding method different from cyclic codes for error-correction in disk is designed. It uses the general q-ary linear block codes for which the principles of encoding and decoding are simple, the capability of burst-error-correcting strong, and the decoding rate fast.
     本文设计的与以往用于磁盘纠错的各种循环码不同的编码方法是多进制的一般线性分组码,其编译码原理简单,纠突发错误能力强,而译码速度快。
短句来源
     An burst-error-correcting scheme,which interleavig Hamming coding,for the serial communication of single-chip microcomputer is presented.
     给出了一种单片机串行通信中纠突发错误的方案 .
短句来源
  “burst-error-correcting”译为未确定词的双语例句
     Burst-Error-Correcting Capabilites of Extending Reversible Goppa Codes
     扩展可逆Goppa码的纠突发能力
短句来源
     RESEARCH ON THE BIT-ERROR PROBABILITY OF BURST-ERROR-CORRECTING CONVOLUTIONAL CODES
     抗突发错误卷积码的误码率估算
短句来源
     Upper and lower bounds on the burst-error-correcting capabilities of extending reversible Goppa Codes are given in this paper.
     本文给出了扩展可逆Goppa码纠突发能力的上、下限。
短句来源
  相似匹配句对
     An Effective Method of Correcting Burst Error
     一种纠突发错误的有效方法
短句来源
     Burst-Error-Correcting Capabilites of Extending Reversible Goppa Codes
     扩展可逆Goppa码的纠突发能力
短句来源
     Error-Correcting Mechanism of Bluetooth
     蓝牙的纠错机制
短句来源
     Error correcting ruler of inductosyn
     感应同步器误差修正尺
短句来源
     TERNARY ERROR CORRECTING CODES
     三值纠错码
短句来源
查询“burst-error-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...

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 relation between b and roots of the codes in derived...

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]。从而首次给出了码的根与纠突发能力之间的关系,并提供了一个构造纠突发错误循环码的极为简便和实用的新方法。

Upper and lower bounds on the burst-error-correcting capabilities of extending reversible Goppa Codes are given in this paper.

本文给出了扩展可逆Goppa码纠突发能力的上、下限。

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

 


 
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) 中国学术期刊(光盘版)电子杂志社