標(biāo)題: Titlebook: Coding Theory and Applications; 3rd International Co Gérard Cohen,Jacques Wolfmann Conference proceedings 1989 Springer-Verlag Berlin Heide [打印本頁(yè)] 作者: FERAL 時(shí)間: 2025-3-21 18:50
書(shū)目名稱(chēng)Coding Theory and Applications影響因子(影響力)
書(shū)目名稱(chēng)Coding Theory and Applications影響因子(影響力)學(xué)科排名
書(shū)目名稱(chēng)Coding Theory and Applications網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱(chēng)Coding Theory and Applications網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱(chēng)Coding Theory and Applications被引頻次
書(shū)目名稱(chēng)Coding Theory and Applications被引頻次學(xué)科排名
書(shū)目名稱(chēng)Coding Theory and Applications年度引用
書(shū)目名稱(chēng)Coding Theory and Applications年度引用學(xué)科排名
書(shū)目名稱(chēng)Coding Theory and Applications讀者反饋
書(shū)目名稱(chēng)Coding Theory and Applications讀者反饋學(xué)科排名
作者: Dictation 時(shí)間: 2025-3-21 22:31 作者: SSRIS 時(shí)間: 2025-3-22 03:28
https://doi.org/10.1007/978-3-642-68770-9eds to be entrusted to a postman, which is able to modify (to some extent) the order of delivery of the transmitted letters. In this paper, we give a survey of the results obtained to date in the analysis of this . channel and we suggest several generalizations.作者: VEST 時(shí)間: 2025-3-22 05:09 作者: 美食家 時(shí)間: 2025-3-22 11:27 作者: 健談 時(shí)間: 2025-3-22 15:20 作者: 健談 時(shí)間: 2025-3-22 20:37
Sediment Load: Concentration and Transport,Parameters and generator matrices are given for the codes obtained by applying Goppa‘s algebraic-geometric construction method to some Artin-Schreier curves over F. where q = p. for some s∈N. Some results on automorphisms of these codes are given.作者: 刪除 時(shí)間: 2025-3-22 22:12 作者: palliative-care 時(shí)間: 2025-3-23 03:02
Die H?hle der Acheuléen-J?ger des LazaretIn this work we present a new authentication algorithm with modified versions suitable for identification and signature. It uses error correcting codes and binary field arithmetic. It has the property that counterfeiting attacks are equivalent to solving NP complete problems. It is easy to implement and is economical in computing power and memory.作者: otic-capsule 時(shí)間: 2025-3-23 05:54 作者: 退潮 時(shí)間: 2025-3-23 13:16 作者: painkillers 時(shí)間: 2025-3-23 17:36
https://doi.org/10.1007/978-94-009-5986-6We describe two methods for computing the minimun polynomial of an element in the finite field GF(q.);both methods have pratically no storage constraint and may improve by a factor 2.6 the classical method.作者: Vldl379 時(shí)間: 2025-3-23 19:03
https://doi.org/10.1007/978-94-009-5986-6In reference (1).R.D.Baker gives a convenient characterisation of Preparata codes..We here give a proof of his description and a similar one for Kerdock codes.作者: Glycogen 時(shí)間: 2025-3-23 22:18
Annotated and Illustrated Bibliography,In this paper we give an upper bound for the minimum distance of the q-ary image of a linear code over GF(q.). This allows us to give some indications about the minimum distance of the q-ary image of MDS codes over GF(q.) when q=2 and q=3.作者: opinionated 時(shí)間: 2025-3-24 04:23
Codes from some Artin-Schreier curves,Parameters and generator matrices are given for the codes obtained by applying Goppa‘s algebraic-geometric construction method to some Artin-Schreier curves over F. where q = p. for some s∈N. Some results on automorphisms of these codes are given.作者: 招募 時(shí)間: 2025-3-24 08:30
New bounds on cyclic codes from algebraic curves,Starting from a deep link between the words of cyclic codes and plane algebraic curves over finite fields we use bounds on the number of rational points of these curves to obtain general bounds for the weights of cyclic codes.作者: LIMN 時(shí)間: 2025-3-24 14:20
A new authentication algorithm,In this work we present a new authentication algorithm with modified versions suitable for identification and signature. It uses error correcting codes and binary field arithmetic. It has the property that counterfeiting attacks are equivalent to solving NP complete problems. It is easy to implement and is economical in computing power and memory.作者: Cerumen 時(shí)間: 2025-3-24 18:46
A method for finding codewords of small weight,We describe a probabilistic algorithm, which can be used to discover words of small weight in a linear binary code. The work-factor of the algorithm is asymptotically quite large but the method can be applied for codes of a medium size. Typical instances that are investigated are codewords of weight 20 in a code of length 300 and dimension 150.作者: TOXIC 時(shí)間: 2025-3-24 20:39 作者: Anthropoid 時(shí)間: 2025-3-25 00:33
Note for computing the minimun polynomial of elements in large finite fields,We describe two methods for computing the minimun polynomial of an element in the finite field GF(q.);both methods have pratically no storage constraint and may improve by a factor 2.6 the classical method.作者: Genteel 時(shí)間: 2025-3-25 07:05
A simple description of Kerdock codes,In reference (1).R.D.Baker gives a convenient characterisation of Preparata codes..We here give a proof of his description and a similar one for Kerdock codes.作者: 易發(fā)怒 時(shí)間: 2025-3-25 08:02
Relation between the minimum weight of a linear code over GF(qm) and its q-ary image over GF(q),In this paper we give an upper bound for the minimum distance of the q-ary image of a linear code over GF(q.). This allows us to give some indications about the minimum distance of the q-ary image of MDS codes over GF(q.) when q=2 and q=3.作者: 憤慨點(diǎn)吧 時(shí)間: 2025-3-25 12:47 作者: motor-unit 時(shí)間: 2025-3-25 16:26
Lecture Notes in Earth Sciencesuse the essential difficulty was that of estimating an exponential sum. It looks possible that in some cases this difficulty could be avoided by relating the demands of (8) and (9) to the estimate given by (10). This approach might lead to elementary proofs and at least it improves some bounds for a作者: 知識(shí) 時(shí)間: 2025-3-25 21:25
Swapan Kumar Maity,Ramkrishna Maitithe genus. It has been shown by J.-P. Serre that A(q)≥c logq, where c is a positive constant. His method, based on the existence of infinite towers of Hilbert-class fields, can give better results ; we give here some new lower bounds for A(q) for certain values of q, and we deduce from these some ne作者: 仇恨 時(shí)間: 2025-3-26 03:55 作者: ESO 時(shí)間: 2025-3-26 05:51
https://doi.org/10.1007/978-3-642-68770-9eds to be entrusted to a postman, which is able to modify (to some extent) the order of delivery of the transmitted letters. In this paper, we give a survey of the results obtained to date in the analysis of this . channel and we suggest several generalizations.作者: lavish 時(shí)間: 2025-3-26 08:31 作者: 粗糙濫制 時(shí)間: 2025-3-26 13:05
https://doi.org/10.1007/978-94-009-5986-6hibitive complexity, especially for long codes. This paper is intended to study a suboptimum symbol-by-symbol weighted-output decoding process of block codes derived from the optimum one. Some variability of the computation effort being allowed, it is shown that the average decoding complexity can b作者: Spinal-Tap 時(shí)間: 2025-3-26 20:31
https://doi.org/10.1007/978-94-009-5986-6liability of the code symbol is used. We outline relationships between generalized minimum distance and correlation which are two criteria equivalent to Maximum Likelihood Decoding (MLD). A sufficient condition which guarantees the correct result of the GMD decoding algorithm is studied. For high si作者: 存心 時(shí)間: 2025-3-27 00:30 作者: crumble 時(shí)間: 2025-3-27 02:46
Annotated and Illustrated Bibliography,own as the .. We propose a model for providing fault- tolerance to the diagnostic scheme and to analyze the performance of the proposed diagnostic scheme. This analysis provides a tradeoff between the complexity of the algorithm and its level of fault-tolerance. However, the optimal solution to the 作者: 發(fā)芽 時(shí)間: 2025-3-27 09:14 作者: MANIA 時(shí)間: 2025-3-27 12:44 作者: 省略 時(shí)間: 2025-3-27 16:30 作者: Estrogen 時(shí)間: 2025-3-27 19:43
Bounds on the use of the postal channel,eds to be entrusted to a postman, which is able to modify (to some extent) the order of delivery of the transmitted letters. In this paper, we give a survey of the results obtained to date in the analysis of this . channel and we suggest several generalizations.作者: 羽毛長(zhǎng)成 時(shí)間: 2025-3-28 00:57
Weighted decoding of linear block codes by solving a system of implicit equations, looks for the posterior distribution in a form separable with respect to the information symbols. The optimal distribution of this form results from minimizing its cross-entropy with respect to the prior distribution, which for a linear code leads to a system of implicit analog equations to be solv作者: Fortify 時(shí)間: 2025-3-28 03:09
Suboptimum weighted-output symbol-by-symbol decoding of block codes,hibitive complexity, especially for long codes. This paper is intended to study a suboptimum symbol-by-symbol weighted-output decoding process of block codes derived from the optimum one. Some variability of the computation effort being allowed, it is shown that the average decoding complexity can b作者: Endemic 時(shí)間: 2025-3-28 06:20 作者: 憂(yōu)傷 時(shí)間: 2025-3-28 13:55 作者: Grasping 時(shí)間: 2025-3-28 17:33 作者: nitric-oxide 時(shí)間: 2025-3-28 20:57 作者: 大火 時(shí)間: 2025-3-29 00:05
Annotated and Illustrated Bibliography,is a NP-hard problem for the Hypercube networks. We discuss various cases for .=8, 16, 32. However, for achieving a level of about 50% fault-tolerance for the proposed diagnostic scheme, we provide an optimal solution valid for all Hypercube networks.作者: FACT 時(shí)間: 2025-3-29 06:56 作者: organic-matrix 時(shí)間: 2025-3-29 07:52 作者: GRIN 時(shí)間: 2025-3-29 12:17 作者: Mercantile 時(shí)間: 2025-3-29 18:09 作者: 清洗 時(shí)間: 2025-3-29 22:32
https://doi.org/10.1007/978-94-009-5986-6k codes derived from the optimum one. Some variability of the computation effort being allowed, it is shown that the average decoding complexity can be reduced without too much impairing the performance.作者: FEAS 時(shí)間: 2025-3-30 03:52 作者: Regurgitation 時(shí)間: 2025-3-30 07:45
Families of codes exceeding the Varshamov-Gilbert bound, Hilbert-class fields, can give better results ; we give here some new lower bounds for A(q) for certain values of q, and we deduce from these some new values of q for which there exists families of codes defined over F., exceeding the Varshamov-Gilbert bound.作者: 托人看管 時(shí)間: 2025-3-30 11:53
Polynomial factorization using Brill-Noether algorithm,ther algorithm to the non-irreducible case. We recall that, in coding theory, this algorithm constructs the generator matrices (or the check matrices) of algebraic-geometric Goppa codes associated to absolutely irreducible projective plane curves.作者: 遍及 時(shí)間: 2025-3-30 13:24
Suboptimum weighted-output symbol-by-symbol decoding of block codes,k codes derived from the optimum one. Some variability of the computation effort being allowed, it is shown that the average decoding complexity can be reduced without too much impairing the performance.作者: 未成熟 時(shí)間: 2025-3-30 18:52
An overview of recent results in the theory of burst-correcting codes,of interleaving or a technique that considers codes over larger fields. These methods are very popular, partly because of their simplicity. Here a survey of other (recent) methods is given, that because of their combinatorial or algebraic structure have better burst-correcting properties and still have low complexity.作者: Triglyceride 時(shí)間: 2025-3-30 22:26 作者: 銼屑 時(shí)間: 2025-3-31 02:01
Codes and character sums,y BCH (and Goppa) codes we have found good asymptotic results. The nonbinary case is quite different: There is a large gap between the best known upper bounds and the best known lower bounds. It would be desirable to close that gap.作者: 精密 時(shí)間: 2025-3-31 07:25
Results of generalized minimum distance decoding for block code of rate 1/2,gnal-to-noise ratios, the GMD decoding algorithm enables to achieve MLD performance with a complexity O(n.). We present, by computer simulation, the behavior of the GMD algorithm for different error-correcting codes, in particular, the results for concatenated schemes (Reed-Solomon outer codes with inner convolutional codes).作者: 摻假 時(shí)間: 2025-3-31 11:21
https://doi.org/10.1007/978-94-009-5986-6gnal-to-noise ratios, the GMD decoding algorithm enables to achieve MLD performance with a complexity O(n.). We present, by computer simulation, the behavior of the GMD algorithm for different error-correcting codes, in particular, the results for concatenated schemes (Reed-Solomon outer codes with inner convolutional codes).作者: bourgeois 時(shí)間: 2025-3-31 17:02 作者: 我要威脅 時(shí)間: 2025-3-31 18:20
9樓作者: 無(wú)法破譯 時(shí)間: 2025-3-31 23:21
9樓作者: ANNUL 時(shí)間: 2025-4-1 05:49
9樓作者: Alcove 時(shí)間: 2025-4-1 10:05
10樓作者: 勾引 時(shí)間: 2025-4-1 11:15
10樓作者: 貨物 時(shí)間: 2025-4-1 14:34
10樓作者: mortuary 時(shí)間: 2025-4-1 22:25
10樓
