Some constructions of systematic authentication codes using Galois rings

Date

2006-12-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

68
views

0
downloads

For q = p(m) and m = 1, we construct systematic authentication codes over finite field F-q using Galois rings. We give corrections of the construction of [ 2]. We generalize corresponding systematic authentication codes of [ 6] in various ways.

Subject Keywords

Applied Mathematics, Computer Science Applications

URI

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

Journal

DESIGNS CODES AND CRYPTOGRAPHY

DOI

https://doi.org/10.1007/s10623-006-9021-x

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

Elements of prescribed order, prescribed traces and systems of rational functions over finite fields Özbudak, Ferruh (Springer Science and Business Media LLC, 2005-01-01) 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 ...
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...
Uniqueness of F-q-quadratic perfect nonlinear maps from F-q3 to F-q(2) Özbudak, Ferruh (Elsevier BV, 2014-09-01) Let q be a power of an odd prime. We prove that all F-q-quadratic perfect nonlinear maps from F-q3 to F-q(2) are equivalent. We also give a geometric method to find the corresponding equivalence explicitly.
Improvements on generalized hamming weights of some trace codes GÜNERİ, CEM; Özbudak, Ferruh (Springer Science and Business Media LLC, 2006-05-01) We obtain improved bounds for the generalized Hamming weights of some trace codes which include a large class of cyclic codes over any finite field. In particular, we improve the corresponding bounds of Stichtenoth and Voss [8] using various methods altogether.
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.

Citation Formats

F. Özbudak, “Some constructions of systematic authentication codes using Galois rings,” DESIGNS CODES AND CRYPTOGRAPHY, pp. 343–357, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46248.