On the minimum weights of ternary linear complementary dual codes

08/23/2019

∙

by   Makoto Araya, et al.

∙

0

∙

share

It is a fundamental problem to determine the largest minimum weight d_3(n,k) among all ternary linear complementary dual [n,k] codes. In this note, we determine d_3(n,4) for n ≡ 11, 14, 16, 17, 20, 24, 29, 30, 33,36,39 40. We also determine d_3(n,k), when (n,k) = (121s+17,5), (364s+13,6), (364s+18,6) and (1093s+14,7), for a nonnegative integer s. In addition, we determine d_3(n,k) for k=n-2,n-3,n-4.