Improvements on generalized hamming weights of some trace codes

Date

2006-05-01

Author

GÜNERİ, CEM
Ö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

187
views

0
downloads

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.

Subject Keywords

Applied Mathematics, Computer Science Applications

URI

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

Journal

DESIGNS CODES AND CRYPTOGRAPHY

DOI

https://doi.org/10.1007/s10623-005-3394-0

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

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...
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.
Systematic authentication codes using additive polynomials Özbudak, Ferruh (Springer Science and Business Media LLC, 2008-12-01) Using additive polynomials related to some curves over finite fields, we construct two families of systematic authentication codes. We use tight bounds for the number of rational points of these curves in estimating the probabilities of the systematic authentication codes. We compare their parameters with some existing codes in the literature. We observe that the parameters are better than the existing ones in some cases.
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.
A note on divisor class groups of degree zero of algebraic function fields over finite fields Özbudak, Ferruh (Elsevier BV, 2003-01-01) We give tight upper bounds on the number of degree one places of an algebraic function field over a finite field in terms of the exponent of a natural subgroup of the divisor class group of degree zero.. (C) 2002 Elsevier Science (USA). All rights reserved.

Citation Formats

C. GÜNERİ and F. Özbudak, “Improvements on generalized hamming weights of some trace codes,” DESIGNS CODES AND CRYPTOGRAPHY, pp. 215–231, 2006, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47110.