繁體版 English 日本語IndonesiaFrancaisРусскийViệt
登录 注册

bch码的英文

发音:  
"bch码"怎么读用"bch码"造句

英文翻译手机手机版

  • bch code

例句与用法

  • The presented method is shown to be right through computer simulation for the ( 23 . 12 ) golay code and the ( 15 , 7 ) bch code
    对golay码和bch码的计算机仿真表明,本文提出的方法是正确的。
  • These sub - codes can be the same or not , bch code , single parity check code , extended hamming code , and so on
    这些子码可以相同也可以不同,可以是bch码、单奇偶校验码、扩展hamming码等。
  • From these conclusions some results are obtained on absolute minimal trellis complexities of extended primitive bch codes and their dual codes of primitive bch codes
    由此得出有关本原bch码的扩展bch码及其对偶码绝对最小网格图复杂度的若干结论。
  • In this paper , we consider the concatenation of bose - chaudury - hocquenheim ( bch ) and repetition codes and present soft - decision decoding schemes based on a map ( maximum a posterior probability ) criterion
    在本文中,我们考虑了bch码和重复码的级联编码,并且基于最大后验概率准则,提出了一种软判决解码方法。
  • Qr code is a kind of 2d matrix barcode . it has high density , great capacity that will influent coding of 2d - barcode . a rs code is cyclic symbol error - correcting code , which can correct lost or missing data for damaged symbols
    Qrcode是一种矩阵二维码,具有信息密度大、容量高的优点,因此,译码时受噪声的干扰大,采用纠错能力比较强的非二进制bch码中的一类? rs码进行编码,可以有效地抗除干扰进行纠错。
  • Some results on the undetected error probability of linear codes for pure error - detection are , at present , generalized for both error detection and correction . an analytic formula is obtained to calculate the undetected error probability of linear block codes for simultaneous error detection and correction
    在只检错时,证明了纠正两个错误扩展bch码是最佳检错码; m大于4的非线性等重码( 2m , 2 , m )不是最佳码。
  • Is the eth residue of p . since the number of quadratic residue mod p is , we can guess the number of eth residue mod p is 2 ^ , and then prove this property . on the basis of eth residue , we construct a type of eth residue code of length p which is an odd prime , and extend some properties of quadratic residue codes . alsi ) we construct a cubic residue code over f % of length 31 and a 4th residue code over fs of length 13 . according to the properties of the bounds of bch codes , we determine the minimal distance of [ 31 , 21 ] code is 5 , which means this code ; can correct two errors
    由模p的二次剩余个数为个,可猜测模p的e次剩余的个数为个,本文给出了该性质的证明。在e次剩余的基础上,本文构造了一类字长p为奇素数的e次剩余码,讨论了它的性质,从而推广了二次剩余码的一些结果。利用所导出的理论结果,我们构造了长为31的二元三次剩余码和长为13的三元四次剩余码,利用bch码上下界的性质,进一步确定了31 , 21码的极小距离为5 ,它可以纠正两个错误。
  • At last , by using the factorization properties of cyclotomic polynmials on finite fields and the construction characteristic of cyclic codes , we present the relation of the period distribution of cyclic codes and the period distribution of their dual codes , establish the explicit formula for the number of the codewords without inner - period of the cyclic codes and their dual codes , find the method for computing the dimension and the period distribution of narrow - sense primitive bch codes , and study the inverse question of period distribution of cyclic codes
    最后,利用有限域上分圆多项式的分解特性和循环码的构造特点,揭示了循环码的周期分布与其对偶码周期分布之间的内在联系,确定了一般循环码及其对偶码内无内周期码字的精确计数公式,决定了狭义本原bch码的维数与周期分布,讨论了循环码周期分布的反问题。
  • The concept of good codes and proper codes for both error detection and correction is presented . it is shown that the binary perfect codes and the primitive double - error - correcting bch codes and their extended codes are proper for both error detection and correction . the primitive triple - error - correcting bch codes with length 2 " " - 1 and their extended codes are proper for odd m > 5 , not for even m > 6
    本文的主要工作是把目前关于只检错时线性码不可检错误概率的研究推广到同时纠错和检错的情况,获得了同时纠检错时线性码不可检错误概率的解析表达式,提出了纠检错好码和最佳纠检错码的概念,并证明了二进制完备码及其扩展码是最佳纠检错码;纠正两个错误二进制本原bch码及其扩展码是最佳纠检错码;码长n = 2 ~ m - 1 、纠正三个错误本原bch码,当m为大于等于5的奇数时是最佳纠检错码;当m为大于等于6的偶数时,不是最佳码。
用"bch码"造句  

其他语种

百科解释

BCH码取自 Bose、Ray-Chaudhuri 与 Hocquenghem 的缩写,是编码理论尤其是纠错码中研究得比较多的一种编码方法。用术语来说,BCH 码是用于校正多个随机错误模式的多级、循环、错误校正、变长数字编码。BCH 码也可以用于质数级或者质数的幂级的多级相移键控。11 级的 BCH 码已经用于表示 10 进制数外加一个符号位。
详细百科解释
bch码的英文翻译,bch码英文怎么说,怎么用英语翻译bch码,bch码的英文意思,bch碼的英文bch码 meaning in Englishbch碼的英文bch码怎么读,发音,例句,用法和解释由查查在线词典提供,版权所有违者必究。