Title :
Improvements to the bounds on optimal ternary linear codes of dimension 6
Author :
Gulliver, T. Aaron
fDate :
9/1/1997 12:00:00 AM
Abstract :
New ternary codes of dimension 6 are presented which improve the bounds on optimal linear codes. These codes belong to the class of quasi-twisted (QT) codes, and have been constructed using a greedy algorithm. This work extends previous results on QT codes of dimension 6. In particular, several new two-weight QT codes are presented. Numerous new optimal codes which meet the Griesmer bound are given, as well as others which establish lower bounds on the maximum minimum distance
Keywords :
linear codes; optimisation; Griesmer bound; QT codes; bounds; dimension 6; greedy algorithm; maximum minimum distance; optimal code; optimal ternary linear codes; quasi-twisted codes; two-weight QT codes; Greedy algorithms; Hamming distance; Linear code; Notice of Violation; Upper bound; Vectors;
Journal_Title :
Information Theory, IEEE Transactions on
