On the lattice of cyclic codes over finite chain rings
In this paper, \(R\) is a finite chain ring of invariants \((q,s)\), and \(\ell\) is a positive integer fulfilling \(\operatorname{gcd}(\ell,q) = 1\). In the language of \(q\)-cyclotomic cosets modulo \(\ell\), the cyclic codes over \(R\) of length \(\ell\) are uniquely decomposed into a direct sum...
Saved in:
Date: | 2019 |
---|---|
Main Authors: | Fotue-Tabue, Alexandre, Mouaha, Christophe |
Format: | Article |
Language: | English |
Published: |
Lugansk National Taras Shevchenko University
2019
|
Subjects: | |
Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/431 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
A nilpotent non abelian group code
by: Nebe, Gabriele, et al.
Published: (2018) -
Isodual and self-dual codes from graphs
by: Mallik, S., et al.
Published: (2021) -
On various parameters of \(\mathbb{Z}_q\)-simplex codes for an even integer \(q\)
by: Pandian, P. Chella, et al.
Published: (2015) -
Semisimple group codes and dihedral codes
by: Dutra, Flaviana S., et al.
Published: (2018) -
Extended binary Golay codes by a group algebra
by: Bortos, Maria Yu., et al.
Published: (2024)