標(biāo)題: Titlebook: Algebraic Coding Theory and Applications; G. Longo Book 1979 CISM Udine 1979 algebra.coding.coding theory [打印本頁] 作者: cessation 時(shí)間: 2025-3-21 16:41
書目名稱Algebraic Coding Theory and Applications影響因子(影響力)
書目名稱Algebraic Coding Theory and Applications影響因子(影響力)學(xué)科排名
書目名稱Algebraic Coding Theory and Applications網(wǎng)絡(luò)公開度
書目名稱Algebraic Coding Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Algebraic Coding Theory and Applications被引頻次
書目名稱Algebraic Coding Theory and Applications被引頻次學(xué)科排名
書目名稱Algebraic Coding Theory and Applications年度引用
書目名稱Algebraic Coding Theory and Applications年度引用學(xué)科排名
書目名稱Algebraic Coding Theory and Applications讀者反饋
書目名稱Algebraic Coding Theory and Applications讀者反饋學(xué)科排名
作者: cringe 時(shí)間: 2025-3-21 22:14
0254-1971 Overview: 978-3-662-38752-8978-3-662-39641-4Series ISSN 0254-1971 Series E-ISSN 2309-3706 作者: 埋伏 時(shí)間: 2025-3-22 00:41 作者: 生氣地 時(shí)間: 2025-3-22 07:59 作者: Concerto 時(shí)間: 2025-3-22 08:59
Clément Henin,Daniel Le MétayerThe N code-words of a binary block error-correcting code. of block length n can be tabulated as the rows of an Nxn matrix: this is the . of the code. The N rows of the code-book are the codewords; the n columns of the code-took are also of interest, and may be called the .作者: 不能逃避 時(shí)間: 2025-3-22 14:48
https://doi.org/10.1007/978-3-030-56554-1We present in these lecture notes a survey of Delsarte’s work on the algebraic theory of association schemes, which has influenced considerably the recent developments in coding theory. We have somewhat updated Delsarte’s original results which are often presented with new proofs. The material has been divided into three main parts.作者: 雪崩 時(shí)間: 2025-3-22 18:43 作者: 誰在削木頭 時(shí)間: 2025-3-23 01:07 作者: 不公開 時(shí)間: 2025-3-23 05:19
,The Bounds of Delsarte and Lovász, and Their Applications to Coding Theory,Our object in this article is to introduce the reader to two important topics in coding theory, and to a recently developed mathematical tool that can be used to derive some extremely important results about them.作者: 敲竹杠 時(shí)間: 2025-3-23 08:53 作者: 承認(rèn) 時(shí)間: 2025-3-23 11:05
Association Schemes,We present in these lecture notes a survey of Delsarte’s work on the algebraic theory of association schemes, which has influenced considerably the recent developments in coding theory. We have somewhat updated Delsarte’s original results which are often presented with new proofs. The material has been divided into three main parts.作者: 名詞 時(shí)間: 2025-3-23 15:58 作者: 極力證明 時(shí)間: 2025-3-23 21:28
https://doi.org/10.1007/978-3-662-39641-4algebra; coding; coding theory作者: 兵團(tuán) 時(shí)間: 2025-3-24 01:02 作者: 使堅(jiān)硬 時(shí)間: 2025-3-24 05:50 作者: 狂怒 時(shí)間: 2025-3-24 07:55 作者: Pudendal-Nerve 時(shí)間: 2025-3-24 14:19
Decidability of Parameterized Verificationg, is coherent correlation detection (or matched filtering) of the sequence of signal elements corresponding to the block length, in the case of a block code, or to the decoder search length, in the case of a convolutional code (see fig. 1(a)). In practice, unless the block or search length (and the作者: CON 時(shí)間: 2025-3-24 16:19
https://doi.org/10.1007/BFb0061047cause of the exponential growth in complexity with increasing constraint length. The minimum distance decoding algorithm proposed in the paper, however, uses a sequential decoding approach to avoid an exponential growth in complexity with increasing constraint length, and also utilises the distance 作者: Verify 時(shí)間: 2025-3-24 20:37
,The monadic second order theory of ω1,ithm for convolutional codes. Firstly, we derive and evaluate upper bounds for the number of decoding operations required to advance one code segment, and show that significantly fewer operations are required than in the case of sequential decoding. This implies a significant reduction in the severi作者: Regurgitation 時(shí)間: 2025-3-25 02:14 作者: Abrupt 時(shí)間: 2025-3-25 07:12
https://doi.org/10.1007/978-3-031-58347-6 in these fields depend heavily on reasoning in the frequency domain. Thus, in the study of real- or complex-valued signals, the Fourier transform plays a basic role. When the time variable is discrete, the discrete Fourier transform plays a parallel role. Accordingly, Fourier transforms and discret作者: calamity 時(shí)間: 2025-3-25 10:24
https://doi.org/10.1007/978-3-031-58347-6ys a basic role. When the time variable is discrete, the discrete Fourier transform plays a parallel role. Accordingly, Fourier transforms and discrete Fourier transforms are among the major tools of engineers.作者: Champion 時(shí)間: 2025-3-25 14:51
Algebraic Codes in the Frequency Domain,ys a basic role. When the time variable is discrete, the discrete Fourier transform plays a parallel role. Accordingly, Fourier transforms and discrete Fourier transforms are among the major tools of engineers.作者: 針葉樹 時(shí)間: 2025-3-25 16:10
https://doi.org/10.1007/978-3-030-56554-1l known, but seme new codes and decoding techniques. will also be described. The motivation for studying array codes is that they are relatively simple to decode, and also, at least in some cases, have relatively high efficiencies (data rates).作者: Clinch 時(shí)間: 2025-3-25 22:20
,The monadic second order theory of ω1, long back-up distances, at the expense of only a small loss in coding gain, and discuss the trade-off between coding gain and storage requirement as an aid to quantitative decoder design. Finally, the performance and construction of decoders that utilise hard and soft-decision sub-optimum forms of the algorithm are described.作者: 全等 時(shí)間: 2025-3-26 02:14 作者: 詼諧 時(shí)間: 2025-3-26 07:34
On the design of practical minimum distance convolutional decoders, long back-up distances, at the expense of only a small loss in coding gain, and discuss the trade-off between coding gain and storage requirement as an aid to quantitative decoder design. Finally, the performance and construction of decoders that utilise hard and soft-decision sub-optimum forms of the algorithm are described.作者: lactic 時(shí)間: 2025-3-26 09:58
Generalized quadratic-residue codes,cf. [2]) as codes generated by the adjacency matrices of finite miquelian inversive planes. Recently J.H. van Lint and F.J. Mac-Williams (cf. [4]) showed that the methods that are used to treat QR-codes can easily be generalized to give a completely analogous treatment of the so-called . (GQR-codes).作者: 絆住 時(shí)間: 2025-3-26 14:36
Soft-decision threshold decoders,icity. Decoders for constraint length 2 and 12 segments are described, and their performance in Gaussian noise evaluated. The soft-decision technique used can also be applied to block codes with similar improvements in coding gain, and methods of implementing this are discussed.作者: 辭職 時(shí)間: 2025-3-26 19:56 作者: landmark 時(shí)間: 2025-3-26 21:08 作者: Immunoglobulin 時(shí)間: 2025-3-27 01:40
Array Codes,dimensions (which need not be orthogonal). Array codes can be used for multiple randan-error detection and correction, for burst-error detection and correction, and for detecting and correcting clusters or patches of errors. They are particularly useful when the data to be protected is presented in 作者: angiography 時(shí)間: 2025-3-27 07:04
Generalized quadratic-residue codes,assical) quadratic residue codes (QR-codes). A year earlier H.N. Ward (cf. [8]) had used symplectic geometry to introduce a generalization of QR-codes. Both presentations rely heavily on abstract algebra. Essentially such codes (at least in the binary case) were introduced by Ph. Del-sarte in 1971 (作者: JAMB 時(shí)間: 2025-3-27 11:11 作者: flaunt 時(shí)間: 2025-3-27 15:15
Towards the maximum-likelihood decoding of long convolutional codes,cause of the exponential growth in complexity with increasing constraint length. The minimum distance decoding algorithm proposed in the paper, however, uses a sequential decoding approach to avoid an exponential growth in complexity with increasing constraint length, and also utilises the distance 作者: concise 時(shí)間: 2025-3-27 19:00 作者: LINE 時(shí)間: 2025-3-27 23:33 作者: 啜泣 時(shí)間: 2025-3-28 05:17 作者: 序曲 時(shí)間: 2025-3-28 08:18
Decidability of Parameterized Verificationemodulator (see fig. 1(b)). However, some of the information which would be lost by only correlating over a signal element can be used to assist and improve the decoding process, and vice-versa. Additional information can be fed forward from the demodulator to improve operation of the decoder, or fe作者: 不怕任性 時(shí)間: 2025-3-28 13:33 作者: 性上癮 時(shí)間: 2025-3-28 15:03
Soft Decision Detection Techniques,emodulator (see fig. 1(b)). However, some of the information which would be lost by only correlating over a signal element can be used to assist and improve the decoding process, and vice-versa. Additional information can be fed forward from the demodulator to improve operation of the decoder, or fe作者: CORD 時(shí)間: 2025-3-28 20:09 作者: 感情 時(shí)間: 2025-3-28 23:56
Preserving Variability in Sexual Multi-agent Systems with Diploidy and Dominances its possessors to the current niche. Allele dominance too preserves variability, and without sacrificing adaptivity. These results echo consistent findings in classical population genetics. Since both these factors strongly affect evolution, their inclusion in a model may improve both accuracy, and efficacy, according to the modeller’s motives.作者: PLIC 時(shí)間: 2025-3-29 04:43 作者: 元音 時(shí)間: 2025-3-29 10:36 作者: 散步 時(shí)間: 2025-3-29 12:54
?Bleib zu Hause, Liebling“ — Mütter, Arbeitsm?rkte und staatliche Politik in Polen und den baltischer Art .. ?ffentliche Ma?nahmen sind meist auf die Chancen und M?glichkeiten von Einzelpersonen auf den Arbeitsm?rkten ausgerichtet. Mütter und Frauen im Allgemeinen sind ein sehr gutes Beispiel für Personen, die aktiviert werden k?nnten.作者: CALL 時(shí)間: 2025-3-29 16:27 作者: 出血 時(shí)間: 2025-3-29 22:41 作者: Nebulizer 時(shí)間: 2025-3-30 00:48
