Title :
New optimal quaternary linear codes of dimension 5
Author :
Gulliver, T. Aaron
Author_Institution :
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
fDate :
11/1/1996 12:00:00 AM
Abstract :
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
Keywords :
Galois fields; cyclic codes; linear codes; polynomials; generator polynomials; greedy local search algorithm; lower bound; minimum distance; optimal quaternary linear codes; quasi-cyclic codes; quasi-twisted codes; Councils; Error probability; Feedback communications; Hamming distance; Helium; Information theory; Linear code; Systems engineering and theory; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
