Contents

Ars Combinatoria

  • Research article

New Binary Linear Codes

T. Aaron Gulliver1, Patric R. J. Ostergard2
1Department of Electrical and Electronic Engineering University of Canterbury Christchurch, New Zealandgulliver@elec.canterbury.ac.nz
2Department of Computer Science and Engineering Helsinki University of Technology P.O. Box 5400, 02015 HUT, Finland
  • Published: 31/07/2000

Abstract

In this paper, nineteen new binary linear codes are presented which improve the bounds on the maximum possible minimum distance. These codes belong to the class of quasi-cyclic (QC) codes, and have been constructed using a stochastic optimization algorithm, tabu search. Six of the new codes meet the upper bound on minimum distance and so are optimal.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
T. Aaron Gulliver, Patric R. J. Ostergard. New Binary Linear Codes[J], Ars Combinatoria, Volume 056. 105-112. DOI: .