Skip to main content
Article
A search algorithm for linear codes: progressive dimension growth
Faculty Publications
  • Nuh Aydin, Kenyon College
  • Tsvetan Asamov
Document Type
Article
Publication Date
8-10-2007
Disciplines
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.

Citation Information
Nuh Aydin and Tsvetan Asamov. "A search algorithm for linear codes: progressive dimension growth" (2007)
Available at: http://works.bepress.com/noah_aydin/16/