Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Do non-free LCD codes over finite commutative Frobenius rings exist? (1901.10836v1)

Published 30 Jan 2019 in cs.IT and math.IT

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$.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Sanjit Bhowmick (14 papers)
  2. Alexandre Fotue-Tabue (4 papers)
  3. Edgar Martínez-Moro (35 papers)
  4. Ramakrishna Bandi (6 papers)
  5. Satya Bagchi (12 papers)
Citations (32)

Summary

We haven't generated a summary for this paper yet.