DocumentCode
314005
Title
Improved bounds for ternary linear codes of dimension 7
Author
Gulliver, T. Aaron ; Östergård, Patric R J
Author_Institution
Dept. of Electr. & Electron. Eng., Canterbury Univ., Christchurch, New Zealand
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
85
Abstract
New codes of dimension 7 are presented which give improved bounds on the maximum possible minimum distance of ternary linear codes. The codes are quasi-cyclic, and have been constructed using a tabu search stochastic optimization algorithm
Keywords
cyclic codes; linear codes; optimisation; search problems; stochastic processes; dimension 7 codes; improved bounds; maximum possible minimum distance; quasi-cyclic codes; stochastic optimization algorithm; tabu search; ternary linear codes; Computer science; Cost function; Councils; Hamming distance; Linear code; Mathematics; Optimization methods; Search methods; Stochastic processes; Symmetric matrices;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613000
Filename
613000
Link To Document