- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 5 of 5 (0.04 seconds)Spelling suggestions: "subject:"lieves (amathematics)"" "subject:"lieves (bmathematics)""
| 1 |
The Number Field SieveLukac, Martin. January 2002 (has links)
Thesis (B.A.)--Haverford College, Dept. of Computer Science, 2002. / Title from caption. Includes bibliographical references.
|
| 2 |
A Large Sieve Zero Density Estimate for Maass Cusp FormsLewis, Paul Dunbar January 2017 (has links)
The large sieve method has been used extensively, beginning with Bombieri in 1965, to provide bounds on the number of zeros of Dirichlet L-functions near the line σ = 1. Using the Kuznetsov trace formula and the work of Deshouillers and Iwaniec on Kloosterman sums, it is possible to derive large sieve inequalities for the Fourier coefficients of Maass cusp forms, which may then similarly be used to study the corresponding Hecke-Maass L-functions. Following an approach developed by Gallagher for Dirichlet L-functions, this thesis shows how the large sieve method may be used to prove a zero density estimate, averaged over the Laplace eigenvalues, for Maass cusp forms of weight zero for the congruence subgroup Γ₀(q) for any positive integer q.
|
| 3 |
On zeros of cubic L-functionsXia, Honggang, January 2006 (has links)
Thesis (Ph. D.)--Ohio State University, 2006. / Title from first page of PDF file. Includes bibliographical references (p. 31-32).
|
| 4 |
Probabilistic combinatorics in factoring, percolation and related topicsLee, Jonathan David January 2015 (has links)
No description available.
|
| 5 |
Analysis Of A Sieving Heuristic For The Number Field Sieve And Design Of Low-Correlation CDMA SequencesGarg, Gagan 06 1900 (has links)
In this thesis, we investigate in detail, certain important problems in cryptography and coding theory.
In the first part of this thesis, we discuss the number field sieve and compare the two ways in which the sieving step is implemented -one method using the line sieve and the other using the lattice sieve. We discuss why the lattice sieve performs better than the line sieve in the presence of large primes -this has not been attempted before.
In the second part of this thesis, we design low-correlation CDMA sequences over the Quadrature Amplitude Modulation (QAM) alphabet. The sequences proposed in this thesis have the lowest value of the maximum correlation parameter as compared to any other family in the literature.
In the third part of this thesis, we design large families of optimal two-dimensional optical orthogonal codes for optical CDMA. The size of these codes is larger than any other code in the literature.
|
Page generated in 0.1092 seconds