Designs, Codes and Cryptography

, Volume 45, Issue 2, pp 213–217

A search algorithm for linear codes: progressive dimension growth

Authors

  • Tsvetan Asamov
    • Department of MathematicsKenyon College
    • Department of MathematicsKenyon College
Article

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

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.

Keywords

New codesMinimum distance boundsSearch algorithmProgressive dimension Growth (PDG)

AMS Classification

94B05

Copyright information

© Springer Science+Business Media, LLC 2007