The covering radius of all ternary negacyclic codes of even length up to 26 is given. The minimum distances and weight distributions of all codes were recalculated. Seven of the open cases for the least covering radius of ternary linear codes were solved and for the other three cases upper bounds were improved.
['Tsonka Stefanova Baicheva']
On the covering radius of ternary negacyclic codes with length up to 26