Titlebook: Topics in Geometry, Coding Theory and Cryptography; Arnaldo Garcia,Henning Stichtenoth Book 2007 Springer Science+Business Media B.V. 2007

女性

書目名稱Topics in Geometry, Coding Theory and Cryptography影響因子(影響力)




書目名稱Topics in Geometry, Coding Theory and Cryptography影響因子(影響力)學(xué)科排名




書目名稱Topics in Geometry, Coding Theory and Cryptography網(wǎng)絡(luò)公開度




書目名稱Topics in Geometry, Coding Theory and Cryptography網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Topics in Geometry, Coding Theory and Cryptography被引頻次




書目名稱Topics in Geometry, Coding Theory and Cryptography被引頻次學(xué)科排名




書目名稱Topics in Geometry, Coding Theory and Cryptography年度引用




書目名稱Topics in Geometry, Coding Theory and Cryptography年度引用學(xué)科排名




書目名稱Topics in Geometry, Coding Theory and Cryptography讀者反饋




書目名稱Topics in Geometry, Coding Theory and Cryptography讀者反饋學(xué)科排名

收集

上腭

議程

Arnaldo Garcia,Henning StichtenothServes as an introduction and invitation to several main directions of research in the area of Function Fields over Finite Fields and their various applications to Information Theory.Reasonably access

裙帶關(guān)系

EXPLICIT TOWERS OF FUNCTION FIELDS OVER FINITE FIELDS,r finite fields. More specifically, we treat here the case of explicit towers; i.e., towers where the function fields are given by explicit equations. The asymptotic behaviour of the genus and of the number of rational places in towers are important features for applications to coding theory and to cryptography (cf. Chapter 2).

LAIR

FUNCTION FIELDS OVER FINITE FIELDS AND THEIR APPLICATIONS TO CRYPTOGRAPHY,ography. This has led researchers in a natural way to consider methods based on some specified function fields in order to construct cryptographic schemes, such as schemes for unconditionally secure authentication, traitor tracing, secret sharing, broadcast encryption and secure multicast, just to mention a few.

aggravate

ARTIN-SCHREIER EXTENSIONS AND THEIR APPLICATIONS, is the degree of the field extension .. If n is relatively prime to ., and there is a primitive . . root of unity in ., then . is a ., i.e. . = .(.) with . . ∈ .. If . = ., then . is an ., i.e. . = .(.) with . . – . ∈ .. Finally, if . = . . for . > 1, then the extension . can be described in terms of .. For these facts, see [34, Section VI.7].

熄滅

闡明

Algebra and Applicationshttp://image.papertrans.cn/u/image/926183.jpg

Horizon

https://doi.org/10.1007/1-4020-5334-4algebra; coding theory; cryptography; finite field; information; information theory; number theory