Results 41 to 50 of about 160 (120)

Euler products, cyclotomy, and coding

open access: yesJournal of Number Theory, 1972
AbstractWe present a familiar manipulation of Euler products and L-series, and derive a recent theorem of Carlitz and an old theorem of Davenport-Hasse. We then show that the theorem of Davenport-Hasse can be used to shed considerable light on certain questions about “irreducible cyclic codes,” and the cyclotomy of finite fields, including some recent ...
McEliece, Robert J, Rumsey, Howard
openaire   +2 more sources

The effects of chronic estradiol treatment on opioid self-administration in intact female rats. [PDF]

open access: yesDrug Alcohol Depend, 2021
Sharp JL   +5 more
europepmc   +1 more source

A note on difference families from cyclotomy

open access: yesDiscrete Mathematics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Cyclotomy Primality Proofs and their Certificates

open access: yes, 2007
The first efficient general primality proving method was proposed in the year 1980 by Adleman, Pomerance and Rumely and it used Jacobi sums. The method was further developed by H. W. Lenstra Jr. and more of his students and the resulting primality proving algorithms are often referred to under the generic name of Cyclotomy Primality Proving (CPP).
openaire   +3 more sources

Cyclotomy ve Şifrelemedeki Bazı Uygulamaları

open access: yes, 2021
Cyclotomic numbers are quite useful algebraic arguments in cryptology. However calculation of these numbers in terms of the definition is getting harder while parameters are getting larger. Some of the properties of cyclotomic numbers provide to express them in terms of Diophant equations.
openaire   +3 more sources

The cyclotomy of Kloosterman sums [PDF]

open access: yesActa Arithmetica, 1967
Lehmer, D. H., Lehmer, Emma
openaire   +1 more source

Mixed cyclotomy, prime-power circulants, and cyclotomy modulo p = ef+1 for composite e

open access: yesJournal of Number Theory, 1969
AbstractAn explicit formula for the cyclotomic numbers modulo prime p ≡ 1 (mod ee′) is given in terms of the cyclotomic numbers for p, e and p, e′, and the mixed cyclotomic numbers p,(e′, e) when g.c.d. (e, e′) = 1. The derivation of this formula depends upon the invertibility of the circulant coefficient matrix of a system of linear equations ...
openaire   +3 more sources

Cyclotomy and designs [PDF]

open access: yesBulletin of the Australian Mathematical Society, 1982
openaire   +1 more source

Home - About - Disclaimer - Privacy