作者: DEAF 時(shí)間: 2025-3-21 22:18
https://doi.org/10.1057/978-1-137-49941-7rticular both Maximum Likelihood and Unique Coset Leader decoding strategies are investigated when applied to Reed-Solomon codes. Therefore referring to these codes several explicit formulas for the evaluation of the symbol error probability are obtained.作者: hematuria 時(shí)間: 2025-3-22 03:32 作者: Interstellar 時(shí)間: 2025-3-22 06:40
ative group .*.. If X is an algebraic curve defined over .. and if G is a divisor on X, we define a non linear code Γ(q, X, G, n, χ) on an alphabet with n+1 letters. We compute the parameters of this code, through the consideration of some character sums.作者: nostrum 時(shí)間: 2025-3-22 09:56
A note on automorphism groups of codes and symbol error probability computation,rticular both Maximum Likelihood and Unique Coset Leader decoding strategies are investigated when applied to Reed-Solomon codes. Therefore referring to these codes several explicit formulas for the evaluation of the symbol error probability are obtained.作者: Constrain 時(shí)間: 2025-3-22 14:38
A family of binary codes with asymptotically good distance distribution,r) have binomial distance distribution, an infinite sequence of even self-dual codes based on Hadamard matrices is constructed that is conjectured to satisfy the requirements. The first two codes in the sequence are the extended Hamming [8,4,4] and Golay [24,12,8] codes.作者: Constrain 時(shí)間: 2025-3-22 18:16
Multiplicative character sums and non linear geometric codes,ative group .*.. If X is an algebraic curve defined over .. and if G is a divisor on X, we define a non linear code Γ(q, X, G, n, χ) on an alphabet with n+1 letters. We compute the parameters of this code, through the consideration of some character sums.作者: 使人煩燥 時(shí)間: 2025-3-23 00:08 作者: poliosis 時(shí)間: 2025-3-23 02:49
Alex Borgoo,Paul Geerlings,K. D. SenWe give new properties about Fourier coefficients and we prove that the distance of the first order Reed-Muller code of length 512 to any cubic is at most 240.作者: 闡明 時(shí)間: 2025-3-23 08:21 作者: 情愛(ài) 時(shí)間: 2025-3-23 20:08
Aufl?sung linearer GleichungssystemeFollowing R. Pellikaan who gave, in 1989, an algorithm which decodes geometric codes up to . errors where d* is the designed distance of the code, we describe an effective decoding procedure for some geometric codes on the Klein quartic.作者: apiary 時(shí)間: 2025-3-23 22:57 作者: 工作 時(shí)間: 2025-3-24 06:17
A direct proof for the automorphism group of reed solomon codes,We introduce a special basis for the description of the primitive extended cyclic codes, considered as subspaces of the modular algebra A=GF(p.)[GF(p.)]. Using properties of this basis, we determine the automorphism group of some extended cyclic codes, among the extended Reed Solomon codes.作者: 反對(duì) 時(shí)間: 2025-3-24 09:44
Covering radius of RM(1,9) in RM(3,9),We give new properties about Fourier coefficients and we prove that the distance of the first order Reed-Muller code of length 512 to any cubic is at most 240.作者: FILTH 時(shí)間: 2025-3-24 12:29 作者: incredulity 時(shí)間: 2025-3-24 17:26 作者: Inflammation 時(shí)間: 2025-3-24 20:15
Decoding of codes on hyperelliptic curves,In 1989, R. Pellikaan gave an algorithm which decodes geometric codes up to .-errors, where .* is the designed distance of the code. Unfortunately this algorithm is not completely effective. I present facts about the jacobian of a hyperelliptic curve which permits in some cases to perform the algorithm.作者: 急急忙忙 時(shí)間: 2025-3-24 23:41
Decoding of codes on the klein quartic,Following R. Pellikaan who gave, in 1989, an algorithm which decodes geometric codes up to . errors where d* is the designed distance of the code, we describe an effective decoding procedure for some geometric codes on the Klein quartic.作者: 漂白 時(shí)間: 2025-3-25 07:10
Asymptotically good families of geometric goppa codes and the gilbert-varshamov bound,This note presents a generalization of the fact that most of the classical Goppa codes lie arbitrarily close to the Gilbert-Varshamov bound (cf. [2, p. 229]).作者: Complement 時(shí)間: 2025-3-25 11:16 作者: BRIDE 時(shí)間: 2025-3-25 14:43 作者: SPER 時(shí)間: 2025-3-25 17:34
Der Knotenstabzug. Die Einspanngrade ,.s in a way easy to be followed, and which, when we iterate it, reduces their degrees down to 2 or 3. We deduce that it is as difficult to find a general characterization of the weights in the Reed-Muller codes of order 3 as it is to obtain one in the Reed-Muller codes of any orders. We also use this作者: sinoatrial-node 時(shí)間: 2025-3-25 20:41
https://doi.org/10.1007/BFb0071153of the locators and of the locator polynomial of a codeword x..Because of the dimensions of the problem, we need to use a symbolic computation software, like Maple or Scratchpad II. The method can be ineffective when the length is too large..The paper contains two parts:.In the first part we will pr作者: 啤酒 時(shí)間: 2025-3-26 01:46 作者: AVID 時(shí)間: 2025-3-26 07:31
The unexpected wildness of randomnal errors. In this paper we consider the problem of mapping information sequences of length . into code-words of a .-unidirectional error detecting code of length .. In case of systematic codes we show that the parameters . and . must satisfy the relation .≤2. ?2.+.. Moreover, we give a simple syst作者: 現(xiàn)代 時(shí)間: 2025-3-26 09:08
ative group .*.. If X is an algebraic curve defined over .. and if G is a divisor on X, we define a non linear code Γ(q, X, G, n, χ) on an alphabet with n+1 letters. We compute the parameters of this code, through the consideration of some character sums.作者: 散步 時(shí)間: 2025-3-26 13:37 作者: Antagonism 時(shí)間: 2025-3-26 19:25 作者: syring 時(shí)間: 2025-3-27 00:10
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/300622.jpg作者: 發(fā)微光 時(shí)間: 2025-3-27 02:11
https://doi.org/10.1007/3-540-54303-1Algebraic Codes; Combinatorial Codes; Geometric Codes; Geometrische Codes; Information Security; Informat作者: 小步走路 時(shí)間: 2025-3-27 08:29 作者: Iatrogenic 時(shí)間: 2025-3-27 12:09
G. Gallavotti,A. Martin-L?f,S. Miracle-Solé input/output devices. In these cases it is requested to avoid that some places often change in the binary data, while some other places would rarely change (as in the case of natural binary coding). As a single example, we can think of some E.PROM set up in the most recent smart cards.作者: Assemble 時(shí)間: 2025-3-27 17:09
,Die Burgenpolitik der Staufer im Elsa?,ted kernels problem (Shamir). In this summary, we introduce the reader to the topic, say a little word about each of the schemes mentioned above, describe some of them in detail and provide a bibliography.作者: eulogize 時(shí)間: 2025-3-27 20:59
Minimum-change binary block-codes which are well balanced, input/output devices. In these cases it is requested to avoid that some places often change in the binary data, while some other places would rarely change (as in the case of natural binary coding). As a single example, we can think of some E.PROM set up in the most recent smart cards.作者: expound 時(shí)間: 2025-3-27 22:47
A survey of identification schemes,ted kernels problem (Shamir). In this summary, we introduce the reader to the topic, say a little word about each of the schemes mentioned above, describe some of them in detail and provide a bibliography.作者: HERE 時(shí)間: 2025-3-28 04:47
0302-9743 metric codes - Protection of information - Convolutional codes - Information theory - Modulation - Applications of coding. Five of the sections are introduced by an invited contribution.978-3-540-54303-9978-3-540-47546-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: frozen-shoulder 時(shí)間: 2025-3-28 10:20 作者: Ballerina 時(shí)間: 2025-3-28 13:43 作者: Outshine 時(shí)間: 2025-3-28 18:28
Der Knotenstabzug. Die Einspanngrade ,.al characterization of the weights in the Reed-Muller codes of order 3 as it is to obtain one in the Reed-Muller codes of any orders. We also use this transformation to characterize the existence of some affine sets of bent functions, and to obtain bent functions of degree 4 from bent functions of degree 3.作者: 消瘦 時(shí)間: 2025-3-28 20:03
https://doi.org/10.1007/BFb0071153e the three following facts:.The dual of the BCH code of length 63 and designed distance 9 has true minimum distance 14 (which was already known)..The BCH code of length 1023 and designed distance 253 has minimum distance 253..The cyclic codes of length 2., 2., 2., with generator polynomial ..(.) and ..(.) have minimum distance 4 (see [5]).作者: 憂傷 時(shí)間: 2025-3-29 00:44
The unexpected wildness of randomhod to design .-unidirectional error detecting codes in which the number . of check bits must satisfy the inequality .≤2.?.?1. The encoding and decoding algorithms require time linear in the number . of information bits.作者: Offensive 時(shí)間: 2025-3-29 05:55 作者: BURSA 時(shí)間: 2025-3-29 09:27
Unidirectional error detecting codes,hod to design .-unidirectional error detecting codes in which the number . of check bits must satisfy the inequality .≤2.?.?1. The encoding and decoding algorithms require time linear in the number . of information bits.作者: 異端邪說(shuō)2 時(shí)間: 2025-3-29 12:50 作者: detach 時(shí)間: 2025-3-29 17:07 作者: olfction 時(shí)間: 2025-3-29 22:14
A note on automorphism groups of codes and symbol error probability computation,rticular both Maximum Likelihood and Unique Coset Leader decoding strategies are investigated when applied to Reed-Solomon codes. Therefore referring to these codes several explicit formulas for the evaluation of the symbol error probability are obtained.作者: 宣誓書(shū) 時(shí)間: 2025-3-30 02:51 作者: ARY 時(shí)間: 2025-3-30 07:37
A transformation on boolean functions, its consequences on some problems related to reed-muller cods in a way easy to be followed, and which, when we iterate it, reduces their degrees down to 2 or 3. We deduce that it is as difficult to find a general characterization of the weights in the Reed-Muller codes of order 3 as it is to obtain one in the Reed-Muller codes of any orders. We also use this作者: 要素 時(shí)間: 2025-3-30 08:30 作者: 分開(kāi) 時(shí)間: 2025-3-30 15:27 作者: inferno 時(shí)間: 2025-3-30 17:53
Unidirectional error detecting codes,nal errors. In this paper we consider the problem of mapping information sequences of length . into code-words of a .-unidirectional error detecting code of length .. In case of systematic codes we show that the parameters . and . must satisfy the relation .≤2. ?2.+.. Moreover, we give a simple syst作者: forbid 時(shí)間: 2025-3-30 22:15 作者: Ceramic 時(shí)間: 2025-3-31 01:21
A survey of identification schemes,ty. The protocols used in these schemes are minimum (or even zero)-knowledge protocols, in that they provably leak no substantial knowledge on the entity‘s secret key, provided the mathematical problems on which they lie are effectively hard. Are considered schemes based on factorization problem (Fi作者: 輕快帶來(lái)危險(xiǎn) 時(shí)間: 2025-3-31 05:35
A correlation cryptographic scheme,rix .. The key to the system is an error vector of weight smaller than the error capacity which is added to the coded information vector. Polynomial time attacks have been devised against this scheme..In this work we introduce a secret key coding scheme which relies on a subset . of a particular set作者: Melanocytes 時(shí)間: 2025-3-31 11:55 作者: lymphoma 時(shí)間: 2025-3-31 17:09
,The weights of the duals of binary bch codes of designed distance δ=9,作者: ABHOR 時(shí)間: 2025-3-31 20:45 作者: 紋章 時(shí)間: 2025-3-31 21:59 作者: Offensive 時(shí)間: 2025-4-1 04:11
9樓作者: 外露 時(shí)間: 2025-4-1 06:36
9樓作者: 瑪瑙 時(shí)間: 2025-4-1 12:39
9樓作者: 沉思的魚(yú) 時(shí)間: 2025-4-1 17:35
9樓作者: 惡心 時(shí)間: 2025-4-1 18:44
10樓作者: Traumatic-Grief 時(shí)間: 2025-4-2 01:43
10樓作者: 挑剔為人 時(shí)間: 2025-4-2 03:40
10樓作者: obsession 時(shí)間: 2025-4-2 07:09
10樓
