An exhaustive computer search for finding new curves with many points among fibre products of two Kummer covers over F-5 and F-7

2013-01-01
Özbudak, Ferruh
Yayla, Oguz
Show full item record
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
170
views
0
downloads
In this paper we make an exhaustive computer search for finding new curves with many points among fibre products of 2 Kummer covers of the projective line over F-5 and F-7. At the end of the search, we have 12 records and 6 new entries for the current Table of Curves with Many Points. In particular, we observe that the fibre product
General Mathematics
https://hdl.handle.net/11511/38832
TURKISH JOURNAL OF MATHEMATICS
Department of Mathematics, Article

Suggestions

A generic identification theorem for groups of finite Morley rank
Berkman, A; Borovik, AV (Wiley, 2004-02-01)
The paper contains a final identification theorem for the 'generic' K*-groups of finite Morley rank.
A singularly perturbed differential equation with piecewise constant argument of generalized type
Akhmet, Marat; Mirzakulova, Aziza (The Scientific and Technological Research Council of Turkey, 2018-01-01)
The paper considers the extension of Tikhonov Theorem for singularly perturbed differential equation with piecewise constant argument of generalized type. An approximate solution of the problem has been obtained. A new phenomenon of humping has been observed in the boundary layer area. An illustrative example with simulations is provided.
The static stochastic knapsack problem with normally distributed item sizes
Merzifonluoglu, Yasemin; Geunes, Joseph; Romeijn, H. Edwin (Springer Science and Business Media LLC, 2012-09-01)
This paper develops exact and heuristic algorithms for a stochastic knapsack problem where items with random sizes may be assigned to a knapsack. An item's value is given by the realization of the product of a random unit revenue and the random item size. When the realization of the sum of selected item sizes exceeds the knapsack capacity, a penalty cost is incurred for each unit of overflow, while our model allows for a salvage value for each unit of capacity that remains unused. We seek to maximize the ex...
Improved p-ary codes and sequence families from Galois rings of characteristic p(2)
LİNG, SAN; Özbudak, Ferruh (Society for Industrial & Applied Mathematics (SIAM), 2006-01-01)
This paper explores the applications of a recent bound on some Weil-type exponential sums over Galois rings in the construction of codes and sequences. A family of codes over F-p, mostly nonlinear, of length p(m+1) and size p(2) (.) p(m(D-[D/p2])), where 1 <= D <= p(m/2), is obtained. The bound on this type of exponential sums provides a lower bound for the minimum distance of these codes. Several families of pairwise cyclically distinct p-ary sequences of period p(p(m - 1)) of low correlation are also cons...
ON THE k-TH ORDER LFSR SEQUENCE WITH PUBLIC KEY CRYPTOSYSTEMS
KIRLAR, Barış Bülent; Cil, Melek (Walter de Gruyter GmbH, 2017-06-01)
In this paper, we propose a novel encryption scheme based on the concepts of the commutative law of the k-th order linear recurrences over the finite field F-q for k > 2. The proposed encryption scheme is an ephemeral-static, which is useful in situations like email where the recipient may not be online. The security of the proposed encryption scheme depends on the difficulty of solving some Linear Feedback Shift Register (LFSR) problems. It has also the property of semantic security. For k = 2, we propose ...
Citation Formats
F. Özbudak and O. Yayla, “An exhaustive computer search for finding new curves with many points among fibre products of two Kummer covers over F-5 and F-7,” TURKISH JOURNAL OF MATHEMATICS, pp. 908–913, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38832.
METU IIS - Integrated Information Service open@metu.edu.tr