標(biāo)題: Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 9th International Sy Harold F. Mattson,Teo Mora,T. R. N. Rao Conference p [打印本頁(yè)] 作者: adulation 時(shí)間: 2025-3-21 19:48
書(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é)科排名
作者: CLOT 時(shí)間: 2025-3-21 23:01 作者: 自戀 時(shí)間: 2025-3-22 04:14 作者: LATE 時(shí)間: 2025-3-22 06:16 作者: 本能 時(shí)間: 2025-3-22 11:32
Computing roadmaps of general semi-algebraic sets,stly concerned with sets . ? .., our algorithm can also decide if points in an arbitrary set . ? .. can be joined by a semi-algebraic path, for any real closed field .. Our algorithm computes a one-dimensional semi-algebraic subset ?(.) of . (actually of an embedding of . in a space . for a certain 作者: milligram 時(shí)間: 2025-3-22 14:59 作者: Innocence 時(shí)間: 2025-3-22 17:43 作者: 是他笨 時(shí)間: 2025-3-23 00:05
New systolic architectures for cyclic code encoding,.). Contrary to those published in the litterature, our encoders use the check polynomial H(x) of the code. For an (n,k) cyclic code, the first and second encoder consist respectively of (n-k) and k cells arranged into a serial-in serial-out one-dimensional systolic array. The second encoder perform作者: 膝蓋 時(shí)間: 2025-3-23 01:42
Algebraic constructions of efficient broadcast networks,fy prescribed bounds on the parameters maximum node degree and broadcast diameter. The broadcast diameter of a network is the maximum time required for a message originating at a node of the network to be relayed to all other nodes, under the restriction that in a single time step any node can commu作者: Spinal-Tap 時(shí)間: 2025-3-23 06:25
Error-correction for WIMs and WUMs, write-unidirectional memories (WUMs). After two sections devoted to introducing the problems and defining the notations respectively, we dedicate section 3 to obtaining upper and lower bounds, then constructing WIM codes. The last part of our paper deals with WUM codes, viz. defining the model of e作者: 闡明 時(shí)間: 2025-3-23 11:31 作者: Eosinophils 時(shí)間: 2025-3-23 15:46
Integer multiplication in PARSAC-2 on stock microprocessors,utions written in C versus non-portable solutions with assembly subroutines, and we examine the influence of CISC versus RISC processor architecture, in particular the NS 32332 versus Sun‘s SPARC. We also determine the gains from a parallelization on a shared memory Encore Multimax under Mach. Our s作者: 相一致 時(shí)間: 2025-3-23 21:14
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/159631.jpg作者: ARCH 時(shí)間: 2025-3-23 23:10
https://doi.org/10.1007/3-540-54522-0Algebraic Methods; Algebraische Algorithmen; Algebraische Methoden; Angewandte Algebra; Applied Algebra; 作者: LIMIT 時(shí)間: 2025-3-24 06:26
978-3-540-54522-4Springer-Verlag Berlin Heidelberg 1991作者: Systemic 時(shí)間: 2025-3-24 07:45
Present Status of Japan’s EnergyIf we require not a whole spectrum but only its maximal element, we may truncate well-known fast orthogonal transformation algorithms decreasing significantly their complexity. This approach leads to a very simple decoding algorithms which are surveyed in the paper.作者: opprobrious 時(shí)間: 2025-3-24 14:19 作者: 騎師 時(shí)間: 2025-3-24 15:46 作者: SHRIK 時(shí)間: 2025-3-24 22:51
Implementing some algorithms of kantor,al use. In this paper, we resolve the implementation difficulties for the basic algorithm which finds a normal subgroup of prime index, and algorithms for computing Sylow subgroups, testing solvability, and constructing a subnormal series.作者: 去才蔑視 時(shí)間: 2025-3-25 01:52
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-540-38436-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: bisphosphonate 時(shí)間: 2025-3-25 05:54 作者: Exposition 時(shí)間: 2025-3-25 08:46 作者: fidelity 時(shí)間: 2025-3-25 11:41
Seiichiro Kimura,Hiroshige Matsumoto) codes from function fields over finite fields. As a consequence, we show the existence of many optimal and sub-optimal codes from algebraic geometry. We give necessary conditions for equality to hold in the lower bound on the minimum distance of Goppa codes. An upper bound on the minimum distance 作者: Chameleon 時(shí)間: 2025-3-25 18:24 作者: BLANC 時(shí)間: 2025-3-26 00:00
Energy Technology Roadmaps of Japan..In 1985 it was proposed to use the multiplication on elliptic curves for the implementation of one way functions..Supersingular curves . with #.(..) = q + 1 elements were proposed at that time. New results due to A. Menezes, T. Okamoto and S. Vanstone show, that these curves are not well suited fo作者: 諂媚于人 時(shí)間: 2025-3-26 01:24
?zgür Arslan-Ayaydin,James Thewissenal use. In this paper, we resolve the implementation difficulties for the basic algorithm which finds a normal subgroup of prime index, and algorithms for computing Sylow subgroups, testing solvability, and constructing a subnormal series.作者: Exaggerate 時(shí)間: 2025-3-26 06:30 作者: 巧思 時(shí)間: 2025-3-26 11:39
Electricity Consumption, GDP and Renewablesn or computing connected components of semi-algebraic sets. A cornerstone of this work is a symbolic sign determination algorithm due to Ben-Or, Kozen and Reif [BOKR86]. In this paper we describe a new sign determination method based on the earlier algorithm, but with two advantages: (i) It is faste作者: Integrate 時(shí)間: 2025-3-26 13:24 作者: 模仿 時(shí)間: 2025-3-26 18:19
André Dorsman,Wim Westerman,John L. Simpson.). Contrary to those published in the litterature, our encoders use the check polynomial H(x) of the code. For an (n,k) cyclic code, the first and second encoder consist respectively of (n-k) and k cells arranged into a serial-in serial-out one-dimensional systolic array. The second encoder perform作者: Terminal 時(shí)間: 2025-3-26 22:11 作者: heckle 時(shí)間: 2025-3-27 01:49 作者: 謊言 時(shí)間: 2025-3-27 07:25
Hedging Strategy with Futures Contracts,states of sequential machines using convolutional codes for on-line detection of sequencing errors. In conjunction with this methodology, we defined an equivalence relation on convolutional codes that exhaustively characterizes the possible transient error detection capabilities and complexities of 作者: anarchist 時(shí)間: 2025-3-27 12:06
William A. Cramer,David B. Knaffutions written in C versus non-portable solutions with assembly subroutines, and we examine the influence of CISC versus RISC processor architecture, in particular the NS 32332 versus Sun‘s SPARC. We also determine the gains from a parallelization on a shared memory Encore Multimax under Mach. Our s作者: BACLE 時(shí)間: 2025-3-27 14:14
Electricity Consumption, GDP and Renewablesasures, the complexity of our new algorithm is . randomized, or . deterministic. Note that the combinatorial complexity (complexity in terms of .) in both cases is within a polylog factor of the worst-case lower bound for the number of connected components Ω(..).作者: Intercept 時(shí)間: 2025-3-27 18:43
Electricity Consumption, GDP and Renewablesarithmetic operations over the coefficient field increases with the degree of the coefficients. Our new method allows transcendental functions or derivatives to appear in the coefficients, and the number of arithmetic operations is completely independent of the coefficients.作者: V切開(kāi) 時(shí)間: 2025-3-28 01:32 作者: 無(wú)可爭(zhēng)辯 時(shí)間: 2025-3-28 03:43
,On wiedemann’s method of solving sparse linear systems,作者: 遺傳 時(shí)間: 2025-3-28 08:02 作者: Esophagitis 時(shí)間: 2025-3-28 10:24
An algorithm for the computation of the radical of an ideal in the ring of polynomials,作者: attenuate 時(shí)間: 2025-3-28 15:00
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes9th International Sy作者: 斷斷續(xù)續(xù) 時(shí)間: 2025-3-28 21:34 作者: 使乳化 時(shí)間: 2025-3-29 02:45 作者: 似少年 時(shí)間: 2025-3-29 04:09 作者: 不可磨滅 時(shí)間: 2025-3-29 10:17 作者: Fantasy 時(shí)間: 2025-3-29 13:33
André Dorsman,Wim Westerman,John L. Simpsons encoding with interleaving. The third encoder consists of k.(n-k) cells arranged into a parallel-in parallel-out two-dimensional systolic array. It needs less average time per word encoding than the two other encoders. In all the cases, the architectures are simple, regular and possess the properties of concurrency and modularity.作者: lactic 時(shí)間: 2025-3-29 17:43
Hedging Strategy with Futures Contracts,sequential machine realizations based upon convolutional codes. In this paper, we determine the number of equivalence classes of (., 1) convolutional codes generated by minimal encoders requiring . memory elements and provide a procedure for generating representatives from each equivalence class.作者: 埋葬 時(shí)間: 2025-3-29 20:34
0302-9743 opicof error-correcting codes isone where theory and implementation are unifiedinto asubject both of mathematical beauty and of practicalimportance. Algebraic algorithms are not only interestingtheoretically but alsoimportant in computer andcommunication engineering and many otherfields.This volume 作者: ablate 時(shí)間: 2025-3-30 00:15
https://doi.org/10.1007/978-3-658-11039-0tion 3 to obtaining upper and lower bounds, then constructing WIM codes. The last part of our paper deals with WUM codes, viz. defining the model of errors and constructing multiple-error-correcting codes.作者: insightful 時(shí)間: 2025-3-30 05:27 作者: 山羊 時(shí)間: 2025-3-30 08:32 作者: Nonconformist 時(shí)間: 2025-3-30 14:38 作者: 好忠告人 時(shí)間: 2025-3-30 17:30 作者: Ancillary 時(shí)間: 2025-3-30 23:48 作者: 獨(dú)特性 時(shí)間: 2025-3-31 02:54
New systolic architectures for cyclic code encoding,s encoding with interleaving. The third encoder consists of k.(n-k) cells arranged into a parallel-in parallel-out two-dimensional systolic array. It needs less average time per word encoding than the two other encoders. In all the cases, the architectures are simple, regular and possess the properties of concurrency and modularity.作者: formula 時(shí)間: 2025-3-31 08:27
Concurrent error detection in sequential circuits using convolutional codes,sequential machine realizations based upon convolutional codes. In this paper, we determine the number of equivalence classes of (., 1) convolutional codes generated by minimal encoders requiring . memory elements and provide a procedure for generating representatives from each equivalence class.作者: meretricious 時(shí)間: 2025-3-31 10:08 作者: 基因組 時(shí)間: 2025-3-31 16:34
https://doi.org/10.1007/978-1-4899-5850-1graph-theoretic approaches. It has previously been shown that hypercubes are optimal for degree . and broadcast diameter .. A construction employing dihedral groups is shown to be optimal for degree . and broadcast diameter . + 1.作者: 畏縮 時(shí)間: 2025-3-31 19:09
Algebraic constructions of efficient broadcast networks,graph-theoretic approaches. It has previously been shown that hypercubes are optimal for degree . and broadcast diameter .. A construction employing dihedral groups is shown to be optimal for degree . and broadcast diameter . + 1.作者: Hemoptysis 時(shí)間: 2025-3-31 23:15 作者: 比喻好 時(shí)間: 2025-4-1 05:46
Energy Technology and Valuation Issuese-error correcting BCH code and its dual code is derived. It is shown that ..(.) = 8 for all binary primitive double-error-correcting BCH codes. Also, we prove that the second generalized Hamming weight of [2. – 1,2.]-dual BCH codes satisfies the Griesmer bound for . ≡ 1,2,3 (mod 4) and 0 (mod 12).作者: apiary 時(shí)間: 2025-4-1 08:41 作者: DEAWL 時(shí)間: 2025-4-1 13:19
Conference proceedings 1991or-correcting codes isone where theory and implementation are unifiedinto asubject both of mathematical beauty and of practicalimportance. Algebraic algorithms are not only interestingtheoretically but alsoimportant in computer andcommunication engineering and many otherfields.This volume contains t作者: Graves’-disease 時(shí)間: 2025-4-1 15:32
9樓作者: 單色 時(shí)間: 2025-4-1 22:33
9樓作者: 慎重 時(shí)間: 2025-4-2 02:07
9樓作者: Freeze 時(shí)間: 2025-4-2 05:32
10樓作者: Triglyceride 時(shí)間: 2025-4-2 08:44
10樓作者: Coma704 時(shí)間: 2025-4-2 14:33
10樓作者: 手榴彈 時(shí)間: 2025-4-2 17:19
10樓
