標(biāo)題: Titlebook: Codes on Algebraic Curves; Serguei A. Stepanov Book 1999 Kluwer Academic/Plenum Publishers 1999 Prime.Prime number.algebra.algebraic curve [打印本頁] 作者: Gullet 時(shí)間: 2025-3-21 19:09
書目名稱Codes on Algebraic Curves影響因子(影響力)
書目名稱Codes on Algebraic Curves影響因子(影響力)學(xué)科排名
書目名稱Codes on Algebraic Curves網(wǎng)絡(luò)公開度
書目名稱Codes on Algebraic Curves網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Codes on Algebraic Curves被引頻次
書目名稱Codes on Algebraic Curves被引頻次學(xué)科排名
書目名稱Codes on Algebraic Curves年度引用
書目名稱Codes on Algebraic Curves年度引用學(xué)科排名
書目名稱Codes on Algebraic Curves讀者反饋
書目名稱Codes on Algebraic Curves讀者反饋學(xué)科排名
作者: 滔滔不絕地講 時(shí)間: 2025-3-21 21:29 作者: Cantankerous 時(shí)間: 2025-3-22 02:39 作者: implore 時(shí)間: 2025-3-22 07:03 作者: GLOSS 時(shí)間: 2025-3-22 08:46
Counting Points on Curves over Finite Fieldsld ..This result was proved for the first time by Hasse (in the case of elliptic curves) and Weil (in the general case) using the correspondence theory on .. Here we give an elementary proof based essentially on using only the Riemann—Roch theorem (see Stepanov [184, 185, 187], Bombieri [17], Schmid作者: Barrister 時(shí)間: 2025-3-22 16:29
Decoding Geometric Goppa Codesce of decoding algorithms and ending with ones on the construction of efficient algorithms which can easily be used in practice. For a detailed treatment of the complexity of algorithms we refer the reader to Aho, Hoperoft and Ulman [2].作者: Barrister 時(shí)間: 2025-3-22 17:45 作者: Facilities 時(shí)間: 2025-3-22 22:45 作者: 不易燃 時(shí)間: 2025-3-23 04:16
https://doi.org/10.1007/978-3-030-53149-2In this chapter the basic notions of the theory of error-correcting codes are introduced: the Hamming distance, parameters of codes, linear codes, encoding and decoding procedures, spectrum and duality, the MacWilliams identity and Krawtchouk polynomials.作者: 極大痛苦 時(shí)間: 2025-3-23 06:58 作者: exercise 時(shí)間: 2025-3-23 12:19 作者: 水汽 時(shí)間: 2025-3-23 16:12
Securing Industrial Control SystemsThe existence of good codes coming from classical modular curves is substantiated by the following three phenomena:作者: CHIDE 時(shí)間: 2025-3-23 19:37 作者: 震驚 時(shí)間: 2025-3-23 23:07 作者: Electrolysis 時(shí)間: 2025-3-24 02:40
https://doi.org/10.1007/978-1-4614-1674-6The significance of geometric Goppa codes is clarified when we consider asymptotic problems.作者: EWE 時(shí)間: 2025-3-24 09:33
Codes and Their ParametersIn this chapter the basic notions of the theory of error-correcting codes are introduced: the Hamming distance, parameters of codes, linear codes, encoding and decoding procedures, spectrum and duality, the MacWilliams identity and Krawtchouk polynomials.作者: hardheaded 時(shí)間: 2025-3-24 12:39 作者: REP 時(shí)間: 2025-3-24 16:56 作者: 痛恨 時(shí)間: 2025-3-24 22:48 作者: VAN 時(shí)間: 2025-3-25 02:10
Constructions and PropertiesThis chapter describes Goppa’s construction of linear error-correcting codes coming from algebraic curves over finite fields. There exist several essentially equivalent ways to construct such codes. The first to be considered is the so-called .-construction.作者: 機(jī)構(gòu) 時(shí)間: 2025-3-25 04:12 作者: Eosinophils 時(shí)間: 2025-3-25 07:45
BoundsThe significance of geometric Goppa codes is clarified when we consider asymptotic problems.作者: 排出 時(shí)間: 2025-3-25 11:41
Basma Abd El-Rahiem,Mohamed Hammad should study long codes. However, if the channel has symbol-error probability.then we should expect an average of.errors per received word of length..To correct these we need to have a minimum distance more than..So, if we increase.then.should increase proportionally.作者: 悄悄移動(dòng) 時(shí)間: 2025-3-25 16:36 作者: Expostulate 時(shí)間: 2025-3-25 20:11 作者: evanescent 時(shí)間: 2025-3-26 02:09 作者: LAY 時(shí)間: 2025-3-26 08:10 作者: 細(xì)菌等 時(shí)間: 2025-3-26 10:10 作者: 腫塊 時(shí)間: 2025-3-26 13:58 作者: acrophobia 時(shí)間: 2025-3-26 19:52
Examples and Constructionsnear codes having rather good parameters. A considerable part of these families are predecessors of geometric Goppa codes, therefore we treat the corresponding constructions in this way to demonstrate their close interconnection with the Goppa construction that will be described later on in Part IV.作者: 委屈 時(shí)間: 2025-3-26 23:38
Algebraic Curvess, linear systems, Jacobians, differential forms and their residues, the Riemann—Roch theorem, Hurwitz and Plücker genus formulas, special divisors and Weierstrass points. We do not consider here the arithmetical properties of curves and for that reason the ground field.is assumed to be algebraically closed.作者: 行乞 時(shí)間: 2025-3-27 02:30 作者: agglomerate 時(shí)間: 2025-3-27 08:36 作者: 輕率看法 時(shí)間: 2025-3-27 10:14
Decoding Geometric Goppa Codesce of decoding algorithms and ending with ones on the construction of efficient algorithms which can easily be used in practice. For a detailed treatment of the complexity of algorithms we refer the reader to Aho, Hoperoft and Ulman [2].作者: Oration 時(shí)間: 2025-3-27 14:51 作者: 上下倒置 時(shí)間: 2025-3-27 18:20 作者: 欲望小妹 時(shí)間: 2025-3-28 00:59 作者: 危機(jī) 時(shí)間: 2025-3-28 02:49
Supporting Data Privacy in P2P Systemss, linear systems, Jacobians, differential forms and their residues, the Riemann—Roch theorem, Hurwitz and Plücker genus formulas, special divisors and Weierstrass points. We do not consider here the arithmetical properties of curves and for that reason the ground field.is assumed to be algebraically closed.作者: 冷淡一切 時(shí)間: 2025-3-28 08:53
Privacy in Online Social Networkss of algebraic varieties, we must develop the corresponding theory for the case of non-closed fields such as ? or ..For example, in applying algebraic geometry to coding theory, one should study curves defined over . and their points with coordinates in . (such points are called .).作者: 補(bǔ)助 時(shí)間: 2025-3-28 11:04 作者: CANT 時(shí)間: 2025-3-28 16:43 作者: Exterior 時(shí)間: 2025-3-28 19:59 作者: lactic 時(shí)間: 2025-3-29 02:15
978-1-4613-7167-0Kluwer Academic/Plenum Publishers 1999作者: defuse 時(shí)間: 2025-3-29 03:41
Book 1999oncrete problems in the engineering of information transmission. At the present time there are two essentially different ways to produce asymptotically good codes coming from algebraic curves over a finite field with an extremely large number of rational points. The first way, developed by M. A. Tsf作者: CULP 時(shí)間: 2025-3-29 10:52
the very concrete problems in the engineering of information transmission. At the present time there are two essentially different ways to produce asymptotically good codes coming from algebraic curves over a finite field with an extremely large number of rational points. The first way, developed by M. A. Tsf978-1-4613-7167-0978-1-4615-4785-3作者: 下邊深陷 時(shí)間: 2025-3-29 14:46
9樓作者: SLAY 時(shí)間: 2025-3-29 19:32
9樓作者: 平常 時(shí)間: 2025-3-29 22:42
9樓作者: Ossification 時(shí)間: 2025-3-30 02:35
10樓作者: 討好女人 時(shí)間: 2025-3-30 05:38
10樓作者: 幸福愉悅感 時(shí)間: 2025-3-30 11:16
10樓作者: 干涉 時(shí)間: 2025-3-30 14:24
10樓
