Designs, Codes and Cryptography

, Volume 45, Issue 2, pp 213-217

First online:

A search algorithm for linear codes: progressive dimension growth

  • Tsvetan AsamovAffiliated withDepartment of Mathematics, Kenyon College
  • , Nuh AydinAffiliated withDepartment of Mathematics, Kenyon College Email author 

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.


New codes Minimum distance bounds Search algorithm Progressive dimension Growth (PDG)

AMS Classification