title   
  

Hasse-Weil bound for additive cyclic codes

Güneri, Cem and Özbudak, Ferruh and Özdemir, Funda (2016) Hasse-Weil bound for additive cyclic codes. Designs, Codes, and Cryptography . ISSN 0925-1022 (Print) 1573-7586 (Online) Published Online First http://dx.doi.org/10.1007/s10623-016-0198-3

Warning
There is a more recent version of this item available.
[thumbnail of guneri-ozbudak-ozdemir.pdf] PDF
guneri-ozbudak-ozdemir.pdf
Restricted to Registered users only
Download (355kB) | Request a copy
[thumbnail of journal_version_-_March_2016.pdf] PDF
journal_version_-_March_2016.pdf
Restricted to Registered users only
Download (484kB) | Request a copy

Abstract

We obtain a bound on the minimum distance of additive cyclic codes via number of rational points on certain algebraic curves over nite elds. 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 and provide examples where it yields better results.
Item Type: Article
Uncontrolled Keywords: Additive cyclic code, Algebraic curve over a finite field, Hasse–Weil bound, BCH bound
Subjects: Q Science > QA Mathematics > QA150-272.5 Algebra
Divisions: Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics
Faculty of Engineering and Natural Sciences
Depositing User: Cem Güneri
Date Deposited: 10 Nov 2016 10:23
Last Modified: 17 Aug 2017 15:38
URI: https://research.sabanciuniv.edu/id/eprint/29940

Available Versions of this Item

Actions (login required)

View Item
View Item