New constant weight codes from linear permutation groups

  • Authors:

  • K. J. Nurmela;M. K. Kaikkonen;P. R.J. Ostergard

  • Affiliations:

  • Dept. of Comput. Sci., Helsinki Univ. of Technol., Espoo;-;-

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

Quantified Score

Hi-index 754.84

Visualization

Abstract

New constant weight codes are found by considering certain linear permutation groups. A code is obtained as a collection of orbits of words under such a group. This leads to a difficult optimization problem, where a stochastic search heuristic, tabu search, is used to find good solutions in a feasible amount of time. Nearly 40 new codes of length at most 28 are presented