๐Ÿ“–
On the semiprimitivity of cyclic codes
Yves Aubry, Philippe Langevin

On the semiprimitivity of cyclic codes

Author / Organization:
Science & Mathematics Published 2008 Verification Pending

Overview & Synopsis

We prove, without assuming the Generalized Riemann Hypothesis, but with at most one exception, that an irreducible cyclic code c(p,m,v) with v prime and p of index 2 modulo v is a two-weight code if and only if it is a semiprimitive code or it is one of the six sporadic known codes. The result is proved without any exception for index-two irreducible cyclic c(p,m,v) codes with v prime not congruent to 3 modulo 8. Finally, we prove that these two results hold true in fact for irreducible cyclic code c(p,m,v) such that there is three p-cyclotomic cosets modulo v.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title On the semiprimitivity of cyclic codes
Author / Organization Yves Aubry, Philippe Langevin
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2008
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-155777
Original Source Link Visit Source Page on hal.science »