Some new optimal ternary linear codes
The maximum possible minimum Hamming distance of a ternary \([n,k,d;3]\)-code is determined for many values of \(n\) and \(k\). These results are obtained by a descent method for designing good linear codes.
scientific article; zbMATH DE number 1051426