A search algorithm for linear codes: progressive dimension growth
- First Online:
- Cite this article as:
- Asamov, T. & Aydin, N. Des. Codes Cryptogr. (2007) 45: 213. doi:10.1007/s10623-007-9113-2
- 76 Views
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.