A search algorithm for linear codes: progressive dimension growth
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.
search algorithm progressive dimension growth (pdg) new codes minimum distance bounds