Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 6th International Co Teo Mora Conference proceedings 1989 Springer-Verlag

漂浮

A computer-aided design for sampling a nonlinear analytic system,In a recent paper by S. Monaco and D. Normand-Cyrot, a method for sampling a nonlinear continuous-time system was described. The object of this present work is to propose an algorithm for computing the sampled system. A symbolic language (REDUCE) is used for this.

眨眼

Decoding of generalized concatenated codes,A decoding algorithm for generalized concatenated codes is described which is a modification of the one propsed in [6]. It is shown that the decoding capability is superior and the complexity is less compared to the previous known decoding algorithms for generalized concatenated codes.

ECG769

The multiplicative complexity of boolean functions,y circuits over the basis Λ,⊕,1. We relate L(f) with the dimension of the dual domain D(f); D(f) is the minimal linear space of linear boolean forms such that f modulo linear functions can be written as a function which takes for input linear forms in D(f).

悦耳

On the complexity of computing class groups of algebraic number fields, . of . and assume that 1, .., ..., .. is a .-basis of the maximal order . of .. In this paper we describe an algorithm by which the class group . of . can be computed in .. binary operations where . denotes the discriminant of ..

construct

On the asymptotic badness of cyclic codes with block-lengths composed from a fixed set of prime fachich is upper bounded by a function .(.). Hence, cyclic codes with blocklengths such that all prime factors are in . and which have rate .≥. are asymptotically bad in the sense that for these codes ./. tends to zero as . increases to infinity.

蕨类

Global dimension of associative algebras,vely computable in the following cases: 1) G is a finitely presented monomial algebra; 2) G is a connected graded s.f.p. algebra and the associated monomial algebra A(G) has finite global dimension. The situation is considerably simpler when G has polynomial growth of degree d and gl.dim A(G)<∞. We show that in this case gl.dim G=gl.dim A(G)=d.

explicit

https://doi.org/10.1007/3-540-51083-4Symbol; algebra; algorithms; complexity; computer; computer algebra; computer science; error-correcting cod

完整

978-3-540-51083-3Springer-Verlag Berlin Heidelberg 1989

RENIN

The International Energy Landscape,y circuits over the basis Λ,⊕,1. We relate L(f) with the dimension of the dual domain D(f); D(f) is the minimal linear space of linear boolean forms such that f modulo linear functions can be written as a function which takes for input linear forms in D(f).

事与愿违