Abstract :
It is proved that ternary codes with parameters [15,8,6], [15,9,5], [16,6,8], and [16,7,7] do not exist. This result solves the problem of finding optimal ternary linear codes of length at most 21. A table is given, showing the exact value of d3(n,k) for n⩽21 with the earliest references
Keywords :
linear codes; [15,8,6] code; [15,9,5] code; [16,6,8] code; [16,7,7] code; nonexistence results; optimal ternary linear codes; Chromium; Information theory; Linear code; Upper bound;
