贪婪的人
发表于 2025-3-23 12:48:28
http://reply.papertrans.cn/16/1597/159628/159628_11.png
DECRY
发表于 2025-3-23 17:41:59
http://reply.papertrans.cn/16/1597/159628/159628_12.png
侵蚀
发表于 2025-3-23 18:23:42
http://reply.papertrans.cn/16/1597/159628/159628_13.png
牵索
发表于 2025-3-23 23:31:24
http://reply.papertrans.cn/16/1597/159628/159628_14.png
认为
发表于 2025-3-24 05:13:01
Vahid Vahidinasab,Behnam Mohammadi-Ivatlooan 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
AWRY
发表于 2025-3-24 08:40:48
Ali Paeizi,Mohammad Taghi Ameli,Sasan Azadichains of products of chains of size .,...,. — where . is a prime. We first explain this correspondance ; then we define as special antichains the weakly self-dual codes and the even codes over .(4) which are affine-invariant codes.
蜿蜒而流
发表于 2025-3-24 13:52:50
http://reply.papertrans.cn/16/1597/159628/159628_17.png
脆弱么
发表于 2025-3-24 18:32:42
http://reply.papertrans.cn/16/1597/159628/159628_18.png
放气
发表于 2025-3-24 21:49:04
https://doi.org/10.1007/978-981-16-1256-5 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
atopic-rhinitis
发表于 2025-3-25 01:17:08
https://doi.org/10.1007/978-3-642-48337-0Exhaustive search for minimally autocorrelated binary sequences has not met any conclusive answer yet. We present here a new algorithm which allows us to obtain in a reasonable time results for heretofore unreachable values.