A search algorithm for linear codes: progressive dimension growthFaculty Publications
AbstractThis 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.
Citation InformationNuh Aydin and Tsvetan Asamov. "A search algorithm for linear codes: progressive dimension growth" (2007)
Available at: http://works.bepress.com/noah_aydin/16/