On Some Ternary LCD Codes

The main aim of this paper is to study LCD codes. Linear code with complementary dual(LCD) are those codes which have their intersection with their dual code as t0u. In this paper we will give rather alternative proof of Massey’s theorem[8], which is one of the most important characterization of LCD codes. Let LCDrn, ks3 denote the maximum of possible values of d among rn, k, ds ternary LCD codes. In [4], authors have given upper bound on LCDrn, ks2 and extended this result for LCDrn, ksq , for any q, where q is some prime power. We will discuss cases when this bound is attained for q “ 3.