By Topic

Improved bounds for ternary linear codes of dimension 7

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
T. A. Gulliver ; Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada ; P. R. J. Ostergard

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

Published in:

IEEE Transactions on Information Theory  (Volume:43 ,  Issue: 4 )