Designs, Codes and Cryptography

, Volume 45, Issue 2, pp 213–217

A search algorithm for linear codes: progressive dimension growth


DOI: 10.1007/s10623-007-9113-2

Cite this article as:
Asamov, T. & Aydin, N. Des. Codes Cryptogr. (2007) 45: 213. doi:10.1007/s10623-007-9113-2


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


Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.Department of MathematicsKenyon CollegeGambierUSA

Personalised recommendations