Title :
Improved bounds for ternary linear codes of dimension 7
Author :
Gulliver, T. Aaron ; Östergård, Patric R J
Author_Institution :
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
fDate :
7/1/1997 12:00:00 AM
Abstract :
New codes of dimension 7 are presented which give improved bounds on the maximum possible minimum distance of ternary linear codes. These codes belong to the class of quasi-cyclic codes, and have been constructed using a stochastic optimization algorithm, tabu search. Thirty-two codes are given which improve or establish the current bounds for ternary codes. In addition, a table of upper and lower bounds for d 3(n, 7) is presented for n⩽240
Keywords :
Galois fields; cyclic codes; linear codes; optimisation; polynomials; search problems; stochastic processes; dimension 7 codes; lower bounds; maximum possible minimum distance; quasi-cyclic codes; stochastic optimization algorithm; tabu search; ternary linear codes; upper bounds; Computer science; Councils; Hamming distance; Linear code; Mathematics; Stochastic processes; Systems engineering and theory;
Journal_Title :
Information Theory, IEEE Transactions on
