Optimal ternary linear codes
โ
R. Hill; D. E. Newton
๐
Article
๐
1992
๐
Springer
๐
English
โ 932 KB
Let nq (k, d) denote the smallest value ofn for which there exists a linear In, k, d]-code over GF(q). An In, k, d]-code whose length is equal to nq(k, d) is called optimal. The problem of finding nq(k, d) has received much attention for the case q = 2. We generalize several results to the case of a