EUVIMEDEUVIMED entdecken
Crossref

Classification of Certain Cyclic LCD Codes

Seth Gannon, Hamid Kulosman

Scientific Annals of Computer Science · 2024

DOI: 10.47743/sacs.2024.1.23 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Scientific Annals of Computer Science, 2024. Verfasst von Seth Gannon und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We show that a necessary and sufficient condition for a cyclic code C of length N over a finite chain ring R (whose maximal ideal has nilpotence 2) to be an LCD code is that C = (f(x)), where f(X) is a self-reciprocal monic divisor of XN − 1 in R[X] and x = X + (XN − 1) in R[X]/(XN − 1). A similar, but slightly different, theorem was proved in 2019 by Z. Liu and J. Wang for general finite chain rings (Theorem 25 in [5]). We provide two proofs, both completely different than the proof of Liu and Wang.

Zitieren

APA

Gannon, S., & Kulosman, H. (2024). Classification of Certain Cyclic LCD Codes. Scientific Annals of Computer Science. https://doi.org/10.47743/sacs.2024.1.23

Vancouver

Gannon S, Kulosman H. Classification of Certain Cyclic LCD Codes. Scientific Annals of Computer Science. 2024. doi:10.47743/sacs.2024.1.23

BibTeX
@article{Gannon2024,
  author = {Gannon, Seth and Kulosman, Hamid},
  title = {Classification of Certain Cyclic LCD Codes},
  journal = {Scientific Annals of Computer Science},
  year = {2024},
  doi = {10.47743/sacs.2024.1.23}
}
Kostenlos starten →