On the minimum weights of binary LCD codes and ternary LCD codes (Q2238930)

Linear codes with a complementary-dual (LCD codes for short) are a class of linear codes introduced in [\textit{J. L. Massey}, Discrete Math. 106/107, 337--342 (1992; Zbl 0754.94009)] that have trivial intersection with their duals, i.e. \(C\cap C^\perp=\{0\}\). This class of codes is interesting as it contains asymptotically good codes and has many different applications, e.g. LCD codes provide an optimum linear coding solution for the two-user binary adder channel. This paper focuses on the determination of the parameters of LCD codes defined over the fields \(\mathbb{F}_2\) and \(\mathbb{F}_3\). First, the authors study the existence of LCD codes meeting the Griesmer bound. Afterward, they focus on the determination of the maximum possible minimum weight for some LCD codes of given length and dimension, providing it explicitly for some classes and giving lower bounds for others.