Some new results for optimal ternary linear codes

I. Bouyukliev, J. Simonis
2002 IEEE Transactions on Information Theory  
Let ( ) be the maximum possible minimum Hamming distance of a ternary [ ]-code for given values of and . We describe a package for code extension and use this to prove some new exact values of ( ). Moreover, we classify the ternary [ ( )]-codes for some values of and .
doi:10.1109/18.992814 fatcat:rluiai7a5bhxrpfh56apgjfq3m