银河
发表于 2025-3-21 18:16:43
书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0159628<br><br> <br><br>书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0159628<br><br> <br><br>书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0159628<br><br> <br><br>书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0159628<br><br> <br><br>书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0159628<br><br> <br><br>书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0159628<br><br> <br><br>书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0159628<br><br> <br><br>书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0159628<br><br> <br><br>书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0159628<br><br> <br><br>书目名称Applied Algebra, Algebraic Algorithms and Error-Correcting Codes读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0159628<br><br> <br><br>
Ossification
发表于 2025-3-21 22:41:48
Covering radius for codes obtained from T(m) triangular graphs,damental circuit matrix for it. Using this matrix as a generator matrix we can obtain a single-error-correcting linear code C(T(m)) with parameters:.n=(m(m−1) (m−2))/2, k=(m(m−1) (m−3)+2)/2 and d=3..Using the fact that each codeword in C(T(m)) is formed by a combination of simple circuits in T(m), w
语言学
发表于 2025-3-22 03:30:18
http://reply.papertrans.cn/16/1597/159628/159628_3.png
dialect
发表于 2025-3-22 07:16:41
An Iterative Euclidean Algorithm,an extended algorithm. We show how all polynomials obtained by the classical extended Euclidean algorithm are actually automatically produced by that iterative process..In sum, an algorithm is given which is as economical as BERLEKAMP‘s for decoding and which is proved to perform decoding of alterna
fledged
发表于 2025-3-22 09:57:02
http://reply.papertrans.cn/16/1597/159628/159628_5.png
Externalize
发表于 2025-3-22 13:31:52
Distribution of codewords and decoding error rate in rs codes with application to performance evaluconcerning to it remain to be some treatments. Now, in this paper, we propose a new strategy to determine error rate (measured in bits, symbols,..) suitable for ECC design as well as for performance evaluation to optical disc. It is different essentially from those traditional ones in principle. As
温和女孩
发表于 2025-3-22 21:07:19
Newton symmetric functions and the arithmetic of algebraically closed fields,omial whose roots are the sum (resp. the product) of the roots of two given polynomials. This formula is obtained considering a transformation sending a polynomial in the sequence of its Newton symmetric functions, and allows to obtain a better bound for the complexity of the computation of the abov
Allege
发表于 2025-3-22 23:53:02
http://reply.papertrans.cn/16/1597/159628/159628_8.png
overreach
发表于 2025-3-23 03:06:04
http://reply.papertrans.cn/16/1597/159628/159628_9.png
Priapism
发表于 2025-3-23 05:31:54
Non linear covering codes : A few results and conjectures, For fixed t, μ. (t) is upperbounded by a real number c(t) independent of n. For t=1, one can take c(1)=1.5. We conjecture : .. μ.(1)=1. Another conjecture is : . K(n+2,t+1)≤K(n,t). We prove this for t=1 and discuss a possible way of proving it for higher t, by extensions of the concept of normality.