Additive cyclic codes over finite commutative chain rings

Download

index.pdf

Date

2018-07-01

Author

Martinez-Moro, Edgar
Otal, KAMİL
Özbudak, Ferruh

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

9
views

11
downloads

Additive cyclic codes over Galois rings were investigated in Cao et al. (2015). In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative chain rings, we observe two different kinds of additivity. One of them is a natural generalization of the study in Cao et al. (2015), whereas the other one has some unusual properties especially while constructing dual codes. We interpret the reasons of such properties and illustrate our results giving concrete examples.

Subject Keywords

Theoretical Computer Science, Discrete Mathematics and Combinatorics

URI

https://hdl.handle.net/11511/38769

Journal

DISCRETE MATHEMATICS

DOI

https://doi.org/10.1016/j.disc.2018.03.016

Collections

Department of Mathematics, Article

Citation Formats

E. Martinez-Moro, K. Otal, and F. Özbudak, “Additive cyclic codes over finite commutative chain rings,” DISCRETE MATHEMATICS, vol. 341, no. 7, pp. 1873–1884, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38769.