Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Hasse-Weil bound for additive cyclic codes
Date
2017-01-01
Author
Guneri, Cem
Özbudak, Ferruh
Ozdemir, Funda
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
1
views
0
downloads
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.
Subject Keywords
Applied Mathematics
,
Computer Science Applications
URI
https://hdl.handle.net/11511/36259
Journal
DESIGNS CODES AND CRYPTOGRAPHY
DOI
https://doi.org/10.1007/s10623-016-0198-3
Collections
Department of Mathematics, Article