, Volume 45, Issue 2, pp 213-217
Date: 10 Aug 2007

A search algorithm for linear codes: progressive dimension growth

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper presents an algorithm, called progressive dimension growth (PDG), for the construction of linear codes with a pre-specified length and a minimum distance. A number of new linear codes over GF(5) that have been discovered via this algorithm are also presented.

Communicated by V.D. Tonchev.