Improved bounds for ternary linear codes of dimension 7

  • Authors:

  • T. A. Gulliver;P. R.J. Ostergard

  • Affiliations:

  • Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont.;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.84

Visualization

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