DocumentCode
1552981
Title
Improvements to the bounds on optimal ternary linear codes of dimension 6
Author
Gulliver, T. Aaron
Volume
43
Issue
5
fYear
1997
fDate
9/1/1997 12:00:00 AM
Firstpage
1632
Lastpage
1638
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.623165
Filename
623165
Link To Document