Elements of prescribed order, prescribed traces and systems of rational functions over finite fields

Date

2005-01-01

Author

Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

114
views

0
downloads

Let k greater than or equal to 1 and f(1),..., f(r) is an element of F-qk (x) be a system of rational functions forming a strongly linearly independent set over a finite field F-q. Let gamma(1),..., gamma(r) is an element of F-q be arbitrarily prescribed elements. We prove that for all sufficiently large extensions F-qkm, there is an element xi is an element of F-qkm of prescribed order such that Tr-Fqkm /Fq (f(i) (xi)) = gamma(i) for i = 1,..., r, where Tr-Fqkm/fq is the relative trace map from F-qkm onto F-q. We give some applications to BCH codes, finite field arithmetic and ordered orthogonal arrays. We also solve a question of Helleseth et al. (Hypercubic 4 and 5-designs from Double-Error-Correcting codes, Des. Codes. Cryptgr. 28(2003). pp. 265-282) completely.

Subject Keywords

Applied Mathematics, Computer Science Applications

URI

https://hdl.handle.net/11511/40865

Journal

DESIGNS CODES AND CRYPTOGRAPHY

DOI

https://doi.org/10.1007/s10623-003-4193-0

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

Hasse-Weil bound for additive cyclic codes Guneri, Cem; Özbudak, Ferruh; Ozdemir, Funda (Springer Science and Business Media LLC, 2017-01-01) We obtain a bound on the minimum distance of additive cyclic codes via the number of rational points on certain algebraic curves over finite fields. This is an extension of the analogous bound in the case of classical cyclic codes. Our result is the only general bound on such codes aside from Bierbrauer's BCH bound. We compare our bounds' performance against the BCH bound for additive cyclic codes in a special case and provide examples where it yields better results.
Subspace packings: constructions and bounds Etzion, Tuvi; Kurz, Sascha; Otal, Kamil; Özbudak, Ferruh (Springer Science and Business Media LLC, 2020-09-01) Grassmannian Gq (n, k) is the set of all k-dimensional subspaces of the vector space Fn q. Kotter and Kschischang showed that codes in Grassmannian space can be used for error-correction in random network coding. On the other hand, these codes are q-analogs of codes in the Johnson scheme, i.e. constant dimension codes. These codes of the Grassmannian Gq (n, k) also form a family of q-analogs of block designs and they are called subspace designs. In this paper, we examine one of the last families of q-analog...
Oscillation of higher order neutral type difference equations Zafer, Ağacık (1995-08-11) In this work we are concerned with oscillation of solutions of the neutral difference equation of the form
Constructions and bounds on linear error-block codes LİNG, San; Özbudak, Ferruh (Springer Science and Business Media LLC, 2007-12-01) We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We obtain a Gilbert-Varshamov type construction. Using our bounds and constructions we obtain some infinite families of optimal linear error-block codes over F-2. We also study the asymptotic of linear error-block codes. We define the real valued function alpha (q,m,a) (delta), which is an analog of the important real valued function alpha (q) (delta) in the asymptotic theory of classical linear error-correctin...
ON THE NUMERICAL EVALUATION OF AN OSCILLATING INFINITE SERIES-III Tezer, Münevver (Informa UK Limited, 1990-01-01) An oscillating infinite series involving product of Bessel function J o(x) and an oscillating infinite series involving trigonometric function sin(x) were evaluated and computed numerically in [1] and [2] respectively. In this paper, an oscillating infinite series involving product of exponential, Bessel and trigonometric functions is evaluated. The series is transformed first into the sum of two infinite integrals by using contour integration and then the infinite integral with oscillating integrand is tra...

Citation Formats

F. Özbudak, “Elements of prescribed order, prescribed traces and systems of rational functions over finite fields,” DESIGNS CODES AND CRYPTOGRAPHY, pp. 35–54, 2005, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40865.