In this correspondence, new optimal quaternary linear codes of dimension 5 are presented which extend previously known results. These codes belong to the class of quasi-twisted (QT) codes, and have been obtained using a greedy local search algorithm. Other codes are also given which provide a lower bound on the maximum possible minimum distance. The generator polynomials for these codes are tabulated, and the minimum distances of known QT codes are given
Published in:
Information Theory, IEEE Transactions on
(Volume:42
,
Issue:
6
)
Date of Publication: Nov 1996