BOUNDS AND PROPERTIES OF LCD CODES OVER FIELDS
Journal of Computer Science and Applied Mathematics · 2023
DOI: 10.37418/jcsam.5.1.2 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer Science and Applied Mathematics, 2023. Verfasst von S. Gannon und 1 weiteren Autor:innen.
Abstract (Originalsprache)
In 2020, Pang et al. defined binary $\text{LCD}\; [n,k]$ codes with biggest minimal distance, which meets the Griesmer bound [1]. We give a correction to and provide a different proof for [1, Theorem 4.2], provide a different proof for [1, Theorem 4.3], examine properties of LCD ternary codes, and extend some results found in [6] for any $q$ which is a power of an odd prime.
Zitieren
APA
Gannon, S., & Kulosman, H. (2023). BOUNDS AND PROPERTIES OF LCD CODES OVER FIELDS. Journal of Computer Science and Applied Mathematics. https://doi.org/10.37418/jcsam.5.1.2
Vancouver
Gannon S, Kulosman H. BOUNDS AND PROPERTIES OF LCD CODES OVER FIELDS. Journal of Computer Science and Applied Mathematics. 2023. doi:10.37418/jcsam.5.1.2
BibTeX
@article{Gannon2023,
author = {Gannon, S. and Kulosman, H.},
title = {BOUNDS AND PROPERTIES OF LCD CODES OVER FIELDS},
journal = {Journal of Computer Science and Applied Mathematics},
year = {2023},
doi = {10.37418/jcsam.5.1.2}
}
EUVIMED