Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 11th International S Gérard Cohen,Marc Giusti,Teo Mora Conference proceed

風(fēng)俗習(xí)慣

書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)學(xué)科排名




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡(luò)公開度




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次學(xué)科排名




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用學(xué)科排名




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋




書目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋學(xué)科排名

Ossification

Bivariate polynomial multiplication patterns,gebraic setting with indeterminate coefficients over suitable ground fields, counting essential multiplications only. The . case concerning factors . with entries .... for ., e. g. with ., has complexity (2. + 1).. Here multiplication with single truncation, computing the product . mod .., or mod ..

Melanocytes

Conserve

Variations on minimal codewords in linear codes,r of minimal supports in random codes. In the second part, we propose a generalization of this concept for codes defined as modules over Galois rings. We determine minimal supports for some ?.-linear codes. Finally, we extend a recently established link between the cryptographical problem of secret

Loathe

On the computation of the radical of polynomial complete intersection ideals,, ..] a regular sequence with .:=max. deg f., . the generated ideal, . its radical, and suppose that the factor ring ..,...,..]/. is a Cohen-Macaulay ring. Under these assumptions we exhibit a single exponential algorithm which computes a system of generators of ..

Engaged

Which families of long binary linear codes have a binomial weight distribution?,rning bounds on weight distributions of primitive binary BCH-codes is given in which it is stated that weights of long primitive binary BCH-codes are not binomially distributed. The weight distributions of some particular codes of the last two families are calculated and compared to the values of co

大吃大喝

infinite

正常

On maximal spherical codes I,ng these bounds. Then we show that the fourth Levenshtein bound can be attained in some very special cases only. We prove that no codes with an irrational maximal scalar product meet the third Levenshtein bound. So in dimensions 3 ≤ . ≤ 100 exactly seven codes are known to attain this bound and ten

承認(rèn)

Formal computation of Galois groups with relative resolvents,s, using mostly computations on scalars (and very few on polynomials). It is based on a formal method of specialization of relative resolvents: it consists in expressing the generic coefficients of the resolvent using the powers of a primitive element, thanks to a quadratic space structure; this red