Some constructions of (t, m, s)-nets with improved parameters

Download
2008-07-01
Ling, San
Özbudak, Ferruh
We construct families of digital (t, m, s)-nets over F(4) improving the best known parameters of (t, m, s)nets. We also improve the bound of Niederreiter and Xing in the asymptotic theory of digital (t, tit, s)-nets. (c) 2007 Elsevier Inc. All fights reserved.
FINITE FIELDS AND THEIR APPLICATIONS

Suggestions

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.
Matrix-product constructions of digital nets
Niederreiter, H; Özbudak, Ferruh (Elsevier BV, 2004-07-01)
We present a new construction of digital nets, and more generally of (d,k,m,s)-systems, over finite fields which is an analog of the matrix-product construction of codes. Examples show that this construction can yield digital nets with better parameters compared to competing constructions.
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.
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.
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.
Citation Formats
S. Ling and F. Özbudak, “Some constructions of (t, m, s)-nets with improved parameters,” FINITE FIELDS AND THEIR APPLICATIONS, pp. 658–675, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47947.