標(biāo)題: Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 12th International S Teo Mora,Harold Mattson Conference proceedings 1997 [打印本頁(yè)] 作者: architect 時(shí)間: 2025-3-21 16:10
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes影響因子(影響力)學(xué)科排名
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes被引頻次學(xué)科排名
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes年度引用學(xué)科排名
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋
書(shū)目名稱Applied Algebra, Algebraic Algorithms and Error-Correcting Codes讀者反饋學(xué)科排名
作者: Aspirin 時(shí)間: 2025-3-21 23:51
https://doi.org/10.1007/978-3-319-21239-5ing applications.We establish the symmetry group of ?. for any . and . by determining its isometries.We also show that there is no cyclic subgroup of order .. in .(?.) acting transitively in ?.. Therefore, there exists no ?.-linear code with respect to the cyclic subgroup.作者: 惡名聲 時(shí)間: 2025-3-22 01:11 作者: 痛得哭了 時(shí)間: 2025-3-22 05:02 作者: conduct 時(shí)間: 2025-3-22 10:02 作者: 節(jié)省 時(shí)間: 2025-3-22 12:53 作者: committed 時(shí)間: 2025-3-22 18:20 作者: certitude 時(shí)間: 2025-3-23 00:34 作者: 可用 時(shí)間: 2025-3-23 02:32 作者: exorbitant 時(shí)間: 2025-3-23 05:54
Efficient multivariate factorization over finite fields,. We also needed an efficient implementation of our algorithms in ?.. because any multivariate factorization may depend on several bivariate factorizations..The efficiency of our implementation is illustrated by the ability to factor bivariate polynomials with over a million monomials over a small prime field.作者: Blemish 時(shí)間: 2025-3-23 10:57
Conference proceedings 1997ommutative algebra, real geometry, group theory, etc. on the mathematical side as well as software systems, telecommunication, complexity theory, compression, signal processing, etc. on the computer science and engineering side.作者: AMPLE 時(shí)間: 2025-3-23 15:59
0302-9743 ization, commutative algebra, real geometry, group theory, etc. on the mathematical side as well as software systems, telecommunication, complexity theory, compression, signal processing, etc. on the computer science and engineering side.978-3-540-63163-7978-3-540-69193-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Rodent 時(shí)間: 2025-3-23 21:57
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159626.jpg作者: bioavailability 時(shí)間: 2025-3-24 02:00 作者: landfill 時(shí)間: 2025-3-24 05:49
978-3-540-63163-7Springer-Verlag Berlin Heidelberg 1997作者: ureter 時(shí)間: 2025-3-24 06:35 作者: 驚惶 時(shí)間: 2025-3-24 13:55 作者: 決定性 時(shí)間: 2025-3-24 17:04 作者: 共同生活 時(shí)間: 2025-3-24 21:37 作者: 很是迷惑 時(shí)間: 2025-3-25 00:04
Electricity: A New Challenge for Storage,Let .=.(..,..., x.) be a graded Lie algebra generated by ..,..., ... In this paper, we show that for any element . in . and any order ., exp(.) may be approximated at the order . by a finite product of elementary factors exp(λ.,x.,). We give an explicit construction that avoids any calculation in the Lie algebra.作者: 填料 時(shí)間: 2025-3-25 07:15 作者: neologism 時(shí)間: 2025-3-25 07:31
Exponentiation in finite fields: Theory and practice,Finally we want to outline the main properties for a fast software exponentiation algorithm in .for large .∈?:作者: 吞吞吐吐 時(shí)間: 2025-3-25 12:49 作者: florid 時(shí)間: 2025-3-25 18:25 作者: 挫敗 時(shí)間: 2025-3-25 22:31
Elementary approximation of exponentials of Lie polynomials,Let .=.(..,..., x.) be a graded Lie algebra generated by ..,..., ... In this paper, we show that for any element . in . and any order ., exp(.) may be approximated at the order . by a finite product of elementary factors exp(λ.,x.,). We give an explicit construction that avoids any calculation in the Lie algebra.作者: 草率男 時(shí)間: 2025-3-26 03:59 作者: 陰郁 時(shí)間: 2025-3-26 06:55
,Certain self-dual codes over ?4 and the odd Leech lattice,er, we provide a classification of length 24 double circulant Type I codes over ?. with minimum Euclidean weight 12. These codes determine (via Construction A.) the odd Leech lattice, which is a unique 24-dimensional odd unimodular lattice with minimum norm 3.作者: 附錄 時(shí)間: 2025-3-26 11:48
The split weight (,,, ,,) enumeration of Reed-Muller codes for ,,+,,<2,,,al form for all the relevant Boolean polynomials is derived. These results are applied to analyzing the structure and complexity of subtrellises of codewords of weights less than 2.. of Reed-Muller codes.作者: 分解 時(shí)間: 2025-3-26 14:23
Optimal linear codes of dimension 4 over ,(5),ane arcs in .(2, 5), we prove the nonexistence of codes with parameters [215, 4, 171]. and [209, 4, 166].. This determinesthe exact value of ..(4, .) for .=166, 167, 168, 169, 170, 171. There remain 16 .‘s for which the exact value of .. (4, .) is not known.作者: 最后一個(gè) 時(shí)間: 2025-3-26 19:12 作者: Erythropoietin 時(shí)間: 2025-3-26 22:02 作者: 逢迎白雪 時(shí)間: 2025-3-27 02:55
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-540-69193-8Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 一大塊 時(shí)間: 2025-3-27 07:37
Negative Electrodes in Lithium Systems,inite or infinite). We show that in many cases these bounds cannot be attained. Applications in different antipodal polynomial metric spaces are considered with special emphasis on the Euclidean sphere and the binary Hamming space.作者: hankering 時(shí)間: 2025-3-27 13:11 作者: Thyroxine 時(shí)間: 2025-3-27 17:12 作者: Integrate 時(shí)間: 2025-3-27 21:10
https://doi.org/10.1007/978-981-99-2870-5ane arcs in .(2, 5), we prove the nonexistence of codes with parameters [215, 4, 171]. and [209, 4, 166].. This determinesthe exact value of ..(4, .) for .=166, 167, 168, 169, 170, 171. There remain 16 .‘s for which the exact value of .. (4, .) is not known.作者: 微生物 時(shí)間: 2025-3-28 01:32
https://doi.org/10.1007/978-981-99-2870-5ants of a Borel set, the other by an extremal property of a packing problem. In the second part, we apply these results to prove the simple-connectedness of certain Hilbert schemes by Gr?bner basis theory.作者: 大洪水 時(shí)間: 2025-3-28 04:27 作者: ineluctable 時(shí)間: 2025-3-28 09:53 作者: 嗎啡 時(shí)間: 2025-3-28 11:42
https://doi.org/10.1007/978-3-030-46527-8elease 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. Most of the improvements presented here are incorporated in Maple V Release 4..In particular, we show that we needed a general tool for implementing computations in ...., ..,..., ..]作者: Fraudulent 時(shí)間: 2025-3-28 17:10 作者: 大方不好 時(shí)間: 2025-3-28 22:35
https://doi.org/10.1007/978-3-319-21239-5 ?.-linearity. In this direction, we consider the .-dimensional Lee space of order ., that is, (?., ..), as one of the most interesting spaces for coding applications.We establish the symmetry group of ?. for any . and . by determining its isometries.We also show that there is no cyclic subgroup of 作者: GLARE 時(shí)間: 2025-3-29 01:16
New Approaches to Heat Storage in Buildings,olygonal path between these points which has the minimum number of segments (links) and the minimum ‘total turn’, that is the sum of absolute values of angles of turns of the consecutive polygon links. We describe an algorithm that solves the problem spending polynomial time to construct one segment作者: condemn 時(shí)間: 2025-3-29 03:13 作者: Antioxidant 時(shí)間: 2025-3-29 11:19
https://doi.org/10.1007/978-3-031-38420-2ces. These . include classes of self-dual codes, quasi-twisted codes and, trivially, all the group ring codes and the group codes for the Gaussian channel. We believe this link between algebraic coding theory and low-dimensional group cohomology leads to (i) new ways to generate codes; (ii) a better作者: 軟弱 時(shí)間: 2025-3-29 12:35
Nihal Ali,Shri Ram Manda,Rose Havilah Pullample encoder and can be decoded using standard equipment. Next we find all constacyclic codes whose .-ary images are by a Tschirnhaus transformation isomorphic to shortened cyclic codes. It turns out that this very large class also includes some cyclic codes. As an example the binary image of all cy作者: 凌辱 時(shí)間: 2025-3-29 16:06 作者: HATCH 時(shí)間: 2025-3-29 20:47 作者: 放肆的你 時(shí)間: 2025-3-30 02:33
https://doi.org/10.1007/978-981-99-2870-5ants of a Borel set, the other by an extremal property of a packing problem. In the second part, we apply these results to prove the simple-connectedness of certain Hilbert schemes by Gr?bner basis theory.作者: CONE 時(shí)間: 2025-3-30 04:37
https://doi.org/10.1007/978-1-4613-3667-9tally. Assuming the sparse code parity-check matrix it is demonstrated that, with probability close to one, the algorithm works far beyond the half minimum distance with complexity linearly proportional to the codeword length and the average number of per bit employed parity-checks.作者: 冒煙 時(shí)間: 2025-3-30 09:20
Minimun distance decoding algorithms for linear codes,ve the current decision. Important examples in this class are the minimal-vectors decoding [14] and zero-neighbours decoding [16]. These two methods have some common features that enable us to introduce a general .. We formulate key properties of this decoding, which allows us to analyze known algor作者: Infusion 時(shí)間: 2025-3-30 13:48
Efficient multivariate factorization over finite fields,elease 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. Most of the improvements presented here are incorporated in Maple V Release 4..In particular, we show that we needed a general tool for implementing computations in ...., ..,..., ..]作者: Condescending 時(shí)間: 2025-3-30 18:11 作者: 通便 時(shí)間: 2025-3-30 22:17
,The symmetry group of ?, in the Lee space and the ?,,-linear codes, ?.-linearity. In this direction, we consider the .-dimensional Lee space of order ., that is, (?., ..), as one of the most interesting spaces for coding applications.We establish the symmetry group of ?. for any . and . by determining its isometries.We also show that there is no cyclic subgroup of 作者: 保守 時(shí)間: 2025-3-31 02:42 作者: 潛伏期 時(shí)間: 2025-3-31 06:43
,Certain self-dual codes over ?4 and the odd Leech lattice,er, we provide a classification of length 24 double circulant Type I codes over ?. with minimum Euclidean weight 12. These codes determine (via Construction A.) the odd Leech lattice, which is a unique 24-dimensional odd unimodular lattice with minimum norm 3.作者: 描繪 時(shí)間: 2025-3-31 11:14
Codes from cocycles,ces. These . include classes of self-dual codes, quasi-twisted codes and, trivially, all the group ring codes and the group codes for the Gaussian channel. We believe this link between algebraic coding theory and low-dimensional group cohomology leads to (i) new ways to generate codes; (ii) a better作者: 騷擾 時(shí)間: 2025-3-31 15:10
On the ,-ary image of cyclic codes,mple encoder and can be decoded using standard equipment. Next we find all constacyclic codes whose .-ary images are by a Tschirnhaus transformation isomorphic to shortened cyclic codes. It turns out that this very large class also includes some cyclic codes. As an example the binary image of all cy作者: chastise 時(shí)間: 2025-3-31 17:58
The split weight (,,, ,,) enumeration of Reed-Muller codes for ,,+,,<2,,,al form for all the relevant Boolean polynomials is derived. These results are applied to analyzing the structure and complexity of subtrellises of codewords of weights less than 2.. of Reed-Muller codes.作者: 能量守恒 時(shí)間: 2025-3-31 22:43
Optimal linear codes of dimension 4 over ,(5),ane arcs in .(2, 5), we prove the nonexistence of codes with parameters [215, 4, 171]. and [209, 4, 166].. This determinesthe exact value of ..(4, .) for .=166, 167, 168, 169, 170, 171. There remain 16 .‘s for which the exact value of .. (4, .) is not known.作者: occurrence 時(shí)間: 2025-4-1 05:06 作者: orthopedist 時(shí)間: 2025-4-1 07:54
