BOUNDS AND PROPERTIES OF LCD CODES OVER FIELDS

Abstract

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.