Titlebook: Coding Theory and Number Theory; Toyokazu Hiramatsu,Günter K?hler Book 2003 Springer Science+Business Media Dordrecht 2003 Grad.algebra.co

deflate

書(shū)目名稱Coding Theory and Number Theory影響因子(影響力)




書(shū)目名稱Coding Theory and Number Theory影響因子(影響力)學(xué)科排名




書(shū)目名稱Coding Theory and Number Theory網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Coding Theory and Number Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Coding Theory and Number Theory被引頻次




書(shū)目名稱Coding Theory and Number Theory被引頻次學(xué)科排名




書(shū)目名稱Coding Theory and Number Theory年度引用




書(shū)目名稱Coding Theory and Number Theory年度引用學(xué)科排名




書(shū)目名稱Coding Theory and Number Theory讀者反饋




書(shū)目名稱Coding Theory and Number Theory讀者反饋學(xué)科排名

笨拙的我

viewing some basic facts from elliptic curves over finite fields and modular forms, and shows that the weight distribution of the Melas codes is represented by means of the trace of the Hecke operators acting on the space of cusp forms. Chapter 4 is a systematic study of the algebraic-geometric codes. For a l978-90-481-6257-4978-94-017-0305-5

STELL

無(wú)法治愈

Elliptic Curves, Hecke Operators and Weight Distribution of Codes,ld . then we say that . is defined over the field .. The indexing of the coefficients appears to be strange. It is explained as follows. We assign the weights 3, 2 and . to ., . and .. respectively. Then every term in the equation has total weight 6.

Medicaid

短程旅游

https://doi.org/10.1007/978-94-017-0305-5Grad; algebra; code; coding; coding theory; mathematics; modular curve; number theory; matrix theory

短程旅游

978-90-481-6257-4Springer Science+Business Media Dordrecht 2003

熱烈的歡迎

Seed Germination in Desert PlantsWe consider a polynomial equation of the type ., where . (≥ 2), .,..., .. are positive integers, .∈ .., .., ... , .. ∈ ..and . = .. with a prime .. Such an equation is called a .. By the number . of solutions of this equation (2.1) in .. we mean the number of .-tuples (γ....γ. for which ..

flourish

podiatrist

Diophantine Equations and Cyclic Codes,We consider a polynomial equation of the type ., where . (≥ 2), .,..., .. are positive integers, .∈ .., .., ... , .. ∈ ..and . = .. with a prime .. Such an equation is called a .. By the number . of solutions of this equation (2.1) in .. we mean the number of .-tuples (γ....γ. for which ..