Codes on fibre products of some Kummer coverings

The purpose of this paper is to construct fairly long geometric Goppa codes over F-q with rather good parameters by fibre products of some Kummer coverings, This paper also extends the results of Stepanov [1] and Stepanov and Ozbudak [2]. (C) 1999 Academic Press.


On lower bounds for incomplete character sums over finite fields
Özbudak, Ferruh (Elsevier BV, 1996-01-01)
The purpose of this paper is to extend results of Stepanov (1980; 1994) about lower bounds for incomplete character sums over a prime finite fieldFpto the case of arbitrary finite fieldFq.
Fibre products of Kummer covers and curves with many points
Özbudak, Ferruh (Springer Science and Business Media LLC, 2007-10-01)
We study the general fibre product of any two Kummer covers of the projective line over finite fields. Under some assumptions, we obtain an involved condition for the existence of rational points in the fibre product over a rational point of the projective line so that we determine the exact number of the rational points. Using this, we construct explicit examples of such fibre products with many rational points. In particular we obtain a record and a new entry for the table (
A minimum distance bound for quasi-nD-cyclic codes
Özbudak, Ferruh (Elsevier BV, 2016-09-01)
We provide a new concatenated structure for multidimensional quasi-cyclic (QnDC) codes over F-q and we give a trace representation for their codewords, which extends the known representations of QC and nD cyclic codes. Based on these results, we obtain a minimum distance bound for QnDC dyclic codes. Since QnDC codes are naturally related to nD convolutional codes, this bound also applies to a special class of 1-generator 2D convolutional codes.
Curves with many points and configurations of hyperplanes over finite fields
Özbudak, Ferruh (Elsevier BV, 1999-10-01)
We establish a correspondence between a class of Kummer extensions of the rational function field and configurations of hyperplanes in an affine space. Using this correspondence, we obtain explicit curves over finite fields with many rational points. Some of our examples almost attain the Oesterle bound. (C) 1999 Academic Press.
A relation between quasi-cyclic codes and 2-D cyclic codes
Guneri, Cem; Özbudak, Ferruh (Elsevier BV, 2012-01-01)
We consider a q-ary quasi-cyclic code C of length ml and index l, where both in and l are relatively prime to q. If the constituents of C are cyclic codes, we show that C can also be viewed as a 2-D cyclic code of size m x l over F(q). In case in and l are also coprime to each other, we easily observe that the code C must be equivalent to a cyclic code, which was proved earlier by Lim.
Citation Formats
F. Özbudak, “Codes on fibre products of some Kummer coverings,” FINITE FIELDS AND THEIR APPLICATIONS, pp. 188–205, 1999, Accessed: 00, 2020. [Online]. Available: