| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Hasse-Weil Bound for Additive Cyclic Codes
Abstract : We obtain a bound on the minimum distance of additive cyclic codes via 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 seems to be the only general bound on such codes aside from Bierbrauer's BCH bound.
Cited literature [5 references]
https://hal.inria.fr/hal-01275733
Contributor : Jean-Pierre Tillich <>
Submitted on : Thursday, February 18, 2016 - 9:36:43 AM
Last modification on : Wednesday, December 2, 2020 - 4:54:03 PM
Long-term archiving on: : Thursday, May 19, 2016 - 10:19:37 AM
Contributor : Jean-Pierre Tillich <>
Submitted on : Thursday, February 18, 2016 - 9:36:43 AM
Last modification on : Wednesday, December 2, 2020 - 4:54:03 PM
Long-term archiving on: : Thursday, May 19, 2016 - 10:19:37 AM
File
wcc15-mo3-1.pdf
Files produced by the author(s)