Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 5th International Co Lloren? Huguet,Alain Poli Conference proceedings 198

貪婪的人

DECRY

侵蝕

牽索

認(rèn)為

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

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.

蜿蜒而流

脆弱么

放氣

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

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.