標(biāo)題: Titlebook: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes; 8th International Co Shojiro Sakata Conference proceedings 1991 Springer- [打印本頁] 作者: 水平 時間: 2025-3-21 19:10
書目名稱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é)科排名
作者: 溫和女孩 時間: 2025-3-22 00:14
Single exponential path finding in semialgebraic sets Part I: The case of a regular bounded hypersumialgebraic path of V connecting x. and x.. By the way the algorithm constructs a roadmap of V. In particular we obtain that the number of semialgebraically connected components of V is computable within the mentioned time bounds.作者: 先鋒派 時間: 2025-3-22 01:53 作者: insecticide 時間: 2025-3-22 04:55 作者: FLAG 時間: 2025-3-22 12:19
Harold Umberger,Adrian Gheorghemialgebraic path of V connecting x. and x.. By the way the algorithm constructs a roadmap of V. In particular we obtain that the number of semialgebraically connected components of V is computable within the mentioned time bounds.作者: Engaging 時間: 2025-3-22 13:19 作者: 知識分子 時間: 2025-3-22 17:24
https://doi.org/10.1007/978-3-642-05320-7st asymmetric errors, and codes correcting random and burst asymmetric errors. Furthermore, more efficient .-ary burst-asymmetric-error-correcting codes are presented. When .=2, these codes have approximately .+log..+1/2 log. log.. check bits.作者: evasive 時間: 2025-3-22 23:47 作者: Aspirin 時間: 2025-3-23 03:04
Error-coded algorithms for on-line arithmetic,rected error at the j-th step leads to restriction of precision in the remaining steps but not to a catastrophic termination of the computation. The code-preserving algorithms are developed and their performance and effectiveness evaluated. Two particular schemes based on residue and AN encoding are discussed.作者: GEAR 時間: 2025-3-23 08:37 作者: 瑣碎 時間: 2025-3-23 12:55
Some ideas about fault-tolerant Chinese Remaindering,se algorithms are best suited to the case where errors are unlikely; we compare with a method based on continued fractions. Our methods use only the standard Chinese remaindering operation and equality testing of the reconstructed values.作者: Demulcent 時間: 2025-3-23 14:01 作者: gerontocracy 時間: 2025-3-23 20:05
Energy Sector Diversification in Iran. The mean value and the variance of the linear complexity is derived for the sequence‘s output by randomly chosen substitutions. The special case of permutations as substitutions are investigated, as well. At the end of the paper we propose an extension of the notion of linear complexity.作者: 是比賽 時間: 2025-3-24 00:07 作者: 使高興 時間: 2025-3-24 03:47
0302-9743 ns of the world presented papers at the conference. The papers present new results of recent theoretical and application-oriented research on applied algebra, algebraic algorithms and error-correcting codes.978-3-540-54195-0978-3-540-47489-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 一個姐姐 時間: 2025-3-24 09:24
https://doi.org/10.1007/978-3-642-05320-7 .-UEC & .-UEDis code can be characterized as a .-asymmetric error correcting (.-AEC) code with an added capability for . errors between . errors and . errors. Noting this fact, we propose a simple construction method for .-UEC & .-UEDis codes starting from .-ary .-AEC codes.作者: GULP 時間: 2025-3-24 14:25
A construction method for ,-ary unidirectional error control codes, .-UEC & .-UEDis code can be characterized as a .-asymmetric error correcting (.-AEC) code with an added capability for . errors between . errors and . errors. Noting this fact, we propose a simple construction method for .-UEC & .-UEDis codes starting from .-ary .-AEC codes.作者: 千篇一律 時間: 2025-3-24 18:21 作者: 襲擊 時間: 2025-3-24 20:43 作者: 嚴(yán)厲譴責(zé) 時間: 2025-3-25 02:57 作者: 大溝 時間: 2025-3-25 06:00 作者: Crepitus 時間: 2025-3-25 10:02
https://doi.org/10.1007/978-3-642-05320-7ne arithmetic operations in which the results are generated during the digit-serial input of the operands, beginning always with the most significant digit. The error detection/correction method effectively uses low-cost arithmetic codes since the interconnections between on-line modules are of mini作者: eardrum 時間: 2025-3-25 13:32
https://doi.org/10.1007/978-3-642-05320-7, where . is the maximal length of correctable burst asymmetric errors and . is the number of information symbols. The codes have less check symbols than ordinary burst-error-correcting codes if log.(.?1).+log. log..<.. A decoding algorithm for the codes is also presented. Encoding and decoding of t作者: addict 時間: 2025-3-25 19:42 作者: 急性 時間: 2025-3-25 21:56
https://doi.org/10.1007/978-3-642-05320-7 module of all homogeneous LFSR sequences in R generated by f(x)..The purpose of our paper is to determine the generating polynomial of the recurrence sequences obtained by multiplying the outputs of these LFSRs. When R is a finite field, we present a new explicit and computationally feasible method作者: canvass 時間: 2025-3-26 00:37 作者: WAIL 時間: 2025-3-26 06:56 作者: deactivate 時間: 2025-3-26 12:05 作者: instate 時間: 2025-3-26 16:19
Agnessa O. Inshakova,Igor P. Marchukovdean free distance(..) and obtain large coding gain by intentionally utilizing intersymbol interference(ISI) in a channel. If .-ary modulation signals are transmitted in a channel with ISI, the received signals will be mapped into more than . signal points due to ISI,i.e. a channel memory. In the pr作者: ATP861 時間: 2025-3-26 19:54
Harold Umberger,Adrian Gheorghe an . upper bound on the number of erroneous residues is known. A specific application would be for residue number codes (as distinct from quadratic residue codes). We generalise the method of Ramachandran, and present two general algorithms for this problem, along with two special cases one of whic作者: Decongestant 時間: 2025-3-27 00:15
https://doi.org/10.1007/978-94-007-0719-1tance-Regular Graph. In [6] we introduced the concept of Propelinear Code which is the algebraic structure associated to an .-Latticed, Distance-Regular Graph..In this paper we present a functorial isomorphism between two categories, the category of .-Latticed, Distance Regular Graphs and the catego作者: anesthesia 時間: 2025-3-27 04:58
Harold Umberger,Adrian Gheorghe by a boolean combination of polynomial inequalities. We describe an algorithm which decides in single exponential sequential time and polynomial parallel time whether x. and x. are contained in the same semialgebraically connected component of V. If they do, the algorithm constructs a continuous se作者: altruism 時間: 2025-3-27 08:29 作者: Mendicant 時間: 2025-3-27 13:25
https://doi.org/10.1007/978-3-642-05320-7The paper gives a description of the three binary linear [16,7,6] codes by linking these codes to certain semilinear spaces. The basic technique is repeated puncturing and shortening.作者: 浪費時間 時間: 2025-3-27 14:06 作者: vertebrate 時間: 2025-3-27 19:33 作者: 煩擾 時間: 2025-3-28 01:48 作者: 手勢 時間: 2025-3-28 02:59
A description of the [16,7,6] codes,The paper gives a description of the three binary linear [16,7,6] codes by linking these codes to certain semilinear spaces. The basic technique is repeated puncturing and shortening.作者: cogent 時間: 2025-3-28 07:50
Periodic sequences for absolute type shaft encoders,Periodic sequence for single track absolute-type shaft encoder is studied. The absolute-type shaft encoder detects the absolute angle of rotation. Multi-track one having Gray coded sequence are practically in use. This paper searches possibility of single track absolute-type shaft encoders, and obtains good periodic sequences for them.作者: 致命 時間: 2025-3-28 10:29
Real-valued bent function and its application to the design of balanced quadriphase sequences with A real-valued bent function is newly defined and shown to be useful to design polyphase sequences with optimal correlation properties. As an application of practical importance, balanced quadriphase sequences with optimal correlation properties are designed and shown to be the sum of two binary {1,?1} bent sequences.作者: FEMUR 時間: 2025-3-28 15:30
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes978-3-540-47489-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 結(jié)構(gòu) 時間: 2025-3-28 21:59 作者: Hallowed 時間: 2025-3-29 02:09
https://doi.org/10.1007/3-540-54195-0Algorithms; algebra; algorithm; communication; computer; computer science; error-correcting code; combinato作者: PLE 時間: 2025-3-29 06:02
978-3-540-54195-0Springer-Verlag Berlin Heidelberg 1991作者: 粘 時間: 2025-3-29 09:53 作者: 統(tǒng)治人類 時間: 2025-3-29 11:24
Error-coded algorithms for on-line arithmetic,ne arithmetic operations in which the results are generated during the digit-serial input of the operands, beginning always with the most significant digit. The error detection/correction method effectively uses low-cost arithmetic codes since the interconnections between on-line modules are of mini作者: myelography 時間: 2025-3-29 18:20
Constructions of codes correcting burst asymmetric errors,, where . is the maximal length of correctable burst asymmetric errors and . is the number of information symbols. The codes have less check symbols than ordinary burst-error-correcting codes if log.(.?1).+log. log..<.. A decoding algorithm for the codes is also presented. Encoding and decoding of t作者: 甜瓜 時間: 2025-3-29 23:33 作者: CHOIR 時間: 2025-3-30 03:49
Feasible calculation of the generator for combined LFSR sequences, module of all homogeneous LFSR sequences in R generated by f(x)..The purpose of our paper is to determine the generating polynomial of the recurrence sequences obtained by multiplying the outputs of these LFSRs. When R is a finite field, we present a new explicit and computationally feasible method作者: OASIS 時間: 2025-3-30 06:56 作者: Crepitus 時間: 2025-3-30 11:12
Pseudo-polyphase orthogonal sequence sets with good cross-correlation property,e orthogonal sequences, is introduced from a maximum length sequence (m-sequence) by the inverse DFT, where . is the period of sequences..A periodic sequence is called an orthogonal sequence, when the autocorrelation function is 0 in every term except for period-multiple-shift terms. It is known tha作者: conflate 時間: 2025-3-30 15:31
Coded modulation with generalized multiple concatenation of block codes,d as a code in the euclidean space ... One obtains a concatenated code in the euclidean space .. using binary block codes. In this paper the obtained code is taken as an inner code, which is concatenated with block codes once again. The advantage of this multiple concatenation compared to single con作者: 細(xì)節(jié) 時間: 2025-3-30 20:11
Trellis coded modulation based on time-varying mapping and encoders for utilizing a channel intersydean free distance(..) and obtain large coding gain by intentionally utilizing intersymbol interference(ISI) in a channel. If .-ary modulation signals are transmitted in a channel with ISI, the received signals will be mapped into more than . signal points due to ISI,i.e. a channel memory. In the pr作者: breadth 時間: 2025-3-30 21:09
Some ideas about fault-tolerant Chinese Remaindering, an . upper bound on the number of erroneous residues is known. A specific application would be for residue number codes (as distinct from quadratic residue codes). We generalise the method of Ramachandran, and present two general algorithms for this problem, along with two special cases one of whic作者: 詩集 時間: 2025-3-31 03:43 作者: Inelasticity 時間: 2025-3-31 06:03
Single exponential path finding in semialgebraic sets Part I: The case of a regular bounded hypersu by a boolean combination of polynomial inequalities. We describe an algorithm which decides in single exponential sequential time and polynomial parallel time whether x. and x. are contained in the same semialgebraically connected component of V. If they do, the algorithm constructs a continuous se作者: coddle 時間: 2025-3-31 12:29 作者: ODIUM 時間: 2025-3-31 14:43 作者: 未成熟 時間: 2025-3-31 21:13
Agnessa O. Inshakova,Igor P. Marchukovachieve much larger .. and lower BER than the Ungerboeck‘s coded 4PSK using the time-invariant mapping and encoder in a channel without ISI, providing that their decoding complexity is equivalent. The improvement can increase as a constraint length of the encoder.
