pith. sign in

arxiv: 1901.10836 · v1 · pith:DKMCEU2Onew · submitted 2019-01-30 · 💻 cs.IT · math.IT

Do non-free LCD codes over finite commutative Frobenius rings exist?

classification 💻 cs.IT math.IT
keywords finitecodesringscodecommutativechainfrobeniussome
0
0 comments X
read the original abstract

In this paper, we clarify some aspects on LCD codes in the literature. We first prove that a non-free LCD code does not exist over finite commutative Frobenius local rings. We then obtain a necessary and sufficient condition for the existence of LCD code over finite commutative Frobenius rings. We later show that a free constacyclic code over finite chain ring is LCD if and only if it is reversible, and also provide a necessary and sufficient condition for a constacyclic code to be reversible over finite chain rings. We illustrate the minimum Lee-distance of LCD codes over some finite commutative chain rings and demonstrate the results with examples. We also got some new optimal $\mathbb{Z}_4$ codes of different lengths {which are} cyclic LCD codes over $\mathbb{Z}_4$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.