標(biāo)題: Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 11th International S Gérard Cohen,Marc Giusti,Teo Mora Conference proceed [打印本頁] 作者: 風(fēng)俗習(xí)慣 時間: 2025-3-21 19:43
書目名稱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 時間: 2025-3-21 23:05
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 時間: 2025-3-22 00:55 作者: Conserve 時間: 2025-3-22 06:27
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 時間: 2025-3-22 10:20
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 時間: 2025-3-22 15:45
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作者: 大吃大喝 時間: 2025-3-22 19:09 作者: infinite 時間: 2025-3-23 01:03 作者: 正常 時間: 2025-3-23 02:40
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) 時間: 2025-3-23 06:18
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作者: commune 時間: 2025-3-23 11:42 作者: 戰(zhàn)勝 時間: 2025-3-23 16:26 作者: 書法 時間: 2025-3-23 19:00
,When polynomial equation systems can be “solved” fast?,thod is the use of an alternative data structure: arithmetic networks and straight-line programs with FOR gates. For sequential time complexity measured by the size of these networks we obtain the following result: it is possible to solve any affine or toric zero-dimensional equation system in non-u作者: 清澈 時間: 2025-3-23 23:59
,Triangular systems and factorized Gr?bner bases,alities. Here we discuss, how this approach may be refined to produce triangular systems in the sense of [12] and [13]. Such a refinement guarantees, different to the usual Gr?bner factorizer, to produce a quasi prime decomposition, i.e. the resulting components are at least pure dimensional radical作者: addition 時間: 2025-3-24 03:56
Development of Modern Heating Technologyl terms, which have the chemical formula C.H.. The existence of chemical isomerism was stated by the end of the eighteenth century, it was verified a quarter of a century later and explained another half of a century afterwards. It stimulated the development of graph theory and gave birth to algebra作者: Stagger 時間: 2025-3-24 08:19 作者: 傻瓜 時間: 2025-3-24 13:51 作者: famine 時間: 2025-3-24 18:49 作者: 圓錐體 時間: 2025-3-24 19:49
System Level Specifications and Design,, ..] 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 ..作者: 遺忘 時間: 2025-3-25 02:10 作者: Diluge 時間: 2025-3-25 03:53
Algorithmic/Architectural Level Refinement,y of powerful algorithms endowed with graphical interface modules. Standard applications can be run automatically whereas research projects mostly require small C or C++ programs. The basic philosophy behind the system is to transform problems into standard problems of e.g. group theory, graph theor作者: Mast-Cell 時間: 2025-3-25 10:24
Analog Circuits and Signal Processingnt new methods which reduce the average number of multiplications comparing with well-known methods, such as the binary method and the .-ary method. We do not compare our approach with algorithms based on addition chains since our approach is intended for cryptosystems with large exponent . and the 作者: 指令 時間: 2025-3-25 14:58 作者: Ovulation 時間: 2025-3-25 17:46
Analog Circuits and Signal Processings, 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作者: 脫離 時間: 2025-3-25 21:13 作者: 沙文主義 時間: 2025-3-26 01:24 作者: accessory 時間: 2025-3-26 07:34 作者: 尊嚴(yán) 時間: 2025-3-26 11:16
Fabrication of Electrostatic Converters,alities. Here we discuss, how this approach may be refined to produce triangular systems in the sense of [12] and [13]. Such a refinement guarantees, different to the usual Gr?bner factorizer, to produce a quasi prime decomposition, i.e. the resulting components are at least pure dimensional radical作者: myopia 時間: 2025-3-26 13:29
https://doi.org/10.1007/978-94-009-6409-9We discuss how characters of finite fields and exponential sums can be applied to covering radius problems. In particular we study the covering radius of BCH codes, and upper bounds on the covering radius of a code with a given dual distance.作者: 親屬 時間: 2025-3-26 20:33 作者: Erythropoietin 時間: 2025-3-26 23:34
On algebraic methods in covering radius problems,We discuss how characters of finite fields and exponential sums can be applied to covering radius problems. In particular we study the covering radius of BCH codes, and upper bounds on the covering radius of a code with a given dual distance.作者: 忘川河 時間: 2025-3-27 03:09
Computation in algebraic function fields for effective construction of algebraic-geometric codes,We present a method for effective construction of algebraic-geometric codes based on the Brill-Noether algorithm. This paper is based on a paper by Le Brigand and Risler [8], but the presentation uses only the theory of algebraic function fields of one variable.作者: negligence 時間: 2025-3-27 08:53 作者: FUSE 時間: 2025-3-27 12:12
https://doi.org/10.1007/3-540-60114-7Symbol; algorithm; algorithms; communication; computer; computer algebra; error-correcting code; combinator作者: IOTA 時間: 2025-3-27 15:12 作者: formula 時間: 2025-3-27 20:21
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-540-49440-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: MAIM 時間: 2025-3-27 22:32 作者: padding 時間: 2025-3-28 02:25 作者: brother 時間: 2025-3-28 07:51
Division of entire functions by polynomial ideals,t function can be truncated in order to compute approximations of the coefficients of the power series appearing in the division formula within a given precision. In addition, this method can be applied to the approximation of the value of the remainder function at some point.作者: 敘述 時間: 2025-3-28 13:34 作者: 小故事 時間: 2025-3-28 15:41
Chemical isomerism, a challenge for algebraic combinatorics and for computer science,ular structure elucidation, where a molecule has to be identified from experimental, usually from spectroscopic data. MOLGEN provides the full wealth of mathematically possible structures (multigraphs with given degree sequence, where the vertices are colored by atom names), from which further chemi作者: harrow 時間: 2025-3-28 20:40 作者: 不來 時間: 2025-3-28 23:19 作者: 時間等 時間: 2025-3-29 05:59
How lower and upper complexity bounds meet in elimination theory,作者: Priapism 時間: 2025-3-29 09:48 作者: Criteria 時間: 2025-3-29 14:22 作者: SAGE 時間: 2025-3-29 16:37 作者: 表皮 時間: 2025-3-29 20:44
Algorithmic/Architectural Level Refinement,s equivalent to a certain double coset problem, no polynomial algorithm can be expected to work in the general case. But the reduction techniques used still allow to solve problems of an interesting size. As an example we explain how the 7-designs in the title were found. The two simple 7-designs wi作者: 思考 時間: 2025-3-30 01:51
Analog Circuits and Signal Processingd by the algebraic-combinatoric “Bézout number” of the system which is given by the Hilbert function of a suitable homogeneous ideal. However, in many important cases, the value of the geometric degree is much smaller than the Bézout number since it does not take into account multiplicities or degre作者: 撫慰 時間: 2025-3-30 07:46 作者: 聯(lián)想 時間: 2025-3-30 09:05
https://doi.org/10.1007/978-90-481-2694-1ood candidate to have binomially distributed weights for large code length, i. e., is a good candidate for an asymptotically optimal code family on the binary symmetric channel when decoded by a Maximum-Likelihood-Decoder with all codewords having equal prior probabilities.作者: 逢迎春日 時間: 2025-3-30 13:54 作者: engender 時間: 2025-3-30 16:59 作者: 很是迷惑 時間: 2025-3-30 23:54
Bivariate polynomial multiplication patterns, admits the reduced upper bound 3n. + 4n + 1, opposed to a lower bound of 2.. + 4. + 1. We have a similar saving factor for the . case with factors . of total degree . to be multiplied mod (..,....). There remains the issue to find the exact complexities of these multiplication problems.作者: ONYM 時間: 2025-3-31 04:38 作者: Gudgeon 時間: 2025-3-31 06:44 作者: Mucosa 時間: 2025-3-31 12:37
,Triangular systems and factorized Gr?bner bases,tion at a heuristical level and full decomposition into prime components. Our approach grew up from a consequent interpretation of the algorithmic ideas in [5] as a . quotient computation in favour of early use of (multivariate) factorization. It is implemented in version 2.2 of the REDUCE package CALI [8].作者: 織物 時間: 2025-3-31 14:59
Analog Circuits and Signal Processingcomplexity of constructing the optimal addition chain for such . is too high. We consider the binary representation for the number . and simplify exponentiation by applying ideas close to ideas exploited in data compression. Asymptotical efficiency of the new algorithms is estimated and numerical results are given.作者: Aromatic 時間: 2025-3-31 19:22
Analog Circuits and Signal Processinguces the problem to that of specializing a primitive element, which we are able to do in the case of the descending by successive inclusions. We incidentally supply a way to make separable a resolvent.作者: agitate 時間: 2025-4-1 01:31 作者: 沒收 時間: 2025-4-1 04:10 作者: 箴言 時間: 2025-4-1 07:42
https://doi.org/10.1007/978-94-009-1365-3 We determine minimal supports for some ?.-linear codes. Finally, we extend a recently established link between the cryptographical problem of secret sharing and minimal supports to the case of rings. The resulting secret-sharing schemes have fully and partially authorized coalitions, which permits, e.g., hierarchical access to a common resource.
