Cyclic self-orthogonal codes over finite chain ring
At a glance
- Citations
- 5
- References
- 18
- Comments
- 0
Abstract
In this paper, we study the cyclic self-orthogonal codes over a finite commutative chain ring [Formula: see text], where [Formula: see text] is a prime number. A generating polynomial of cyclic self-orthogonal codes over [Formula: see text] is obtained. We also provide a necessary and sufficient condition for the existence of nontrivial self-orthogonal codes over [Formula: see text]. Finally, we determine the number of the above codes with length [Formula: see text] over [Formula: see text] for any [Formula: see text]. The results are given by Zhe-Xian Wan on cyclic codes over Galois rings in [Z. Wan, Cyclic codes over Galois rings, Algebra Colloq. 6 (1999) 291–304] are extended and strengthened to cyclic self-orthogonal codes over [Formula: see text].
Publication details
- DOI
- 10.1142/s179355711850078x
- OpenAlex
- W2754187194
- Document type
- article
- Language
- EN
- Source
- Asian-European Journal of Mathematics
- Last metadata update
Comments
Log in to join the discussion.