Skip to main content
SpringerLink
Log in

A search algorithm for linear codes: progressive dimension growth

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aydin N, Siap I and Ray-Chaudhuri DK (2001). The structure of 1-generator quasi-twisted codes and new linear codes. Des Codes Cryptogr 24(3): 313–326

    Article  MATH  MathSciNet  Google Scholar 

  • (2006). Discovering mathematics with magma: reducing the abstract to concrete. Springer, Berlin

    MATH  Google Scholar 

  • Brouwer AE. Bounds (Bounds on the minimum distance of linear codes). http://www.win.tue.nl/aeb/voorlincod.html

  • Chen EZ (2007). New quasi-cyclic codes from simpex codes. IEEE Trans Inform Theory 53(1): 1193

    Article  MathSciNet  Google Scholar 

  • Daskalov R, Gulliver TA and Metodieva E (1999). New ternary linear codes. IEEE Trans Inform Theory 45(5): 1687–1688

    Article  MATH  MathSciNet  Google Scholar 

  • Daskalov R and Hristov P (2003). New quasi-twisted degenerate ternary linear codes. IEEE Trans Inform Theory 49(9): 2259–2263

    Article  MathSciNet  Google Scholar 

  • Grassl M. Bounds on the minimum distance of linear codes. http://www.codetables.de

  • Grassl M, White G (2005) New codes from chains of quasi-cyclic codes. In: Proceedings of IEEE international symposium on information theory (ISIT 2005), Adelaide, Australia, September 2005, pp 2095–2099

  • Gulliver TA and Östergard PRJ (2000). New binary linear codes. Ars Combinatoria 56: 105–112

    MATH  MathSciNet  Google Scholar 

  • MacWilliams FJ and Sloane NJA (1977). The theory of error correcting codes. North Holland, Amsterdam

    MATH  Google Scholar 

  • MAGMA computer algebra system. http://magma.maths.usyd.edu.au/magma/MagmaInfo.html

  • Siap I, Aydin N and Ray-Chaudhuri DK (2000). New ternary quasi-cyclic codes with better minimum distances. IEEE Trans Inform Theory 46(4): 1554–1558

    Article  MATH  MathSciNet  Google Scholar 

  • Tsfasman MA and Vlǎdut SG (1991). Algebraic geometry codes. Kluwert, Dordrecht

    Google Scholar 

  • Vardy A (1997). The intractability of computing the minimum distance of a code. IEEE Trans Inform Theory 43(6): 1757–1766

    Article  MATH  MathSciNet  Google Scholar 

  • White G (preprint) An improved minimum weight algorithm for quasi-cyclic and quasi-twisted codes

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Kenyon College, Gambier, OH, 43022, USA

    Tsvetan Asamov & Nuh Aydin

Authors
  1. Tsvetan Asamov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nuh Aydin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nuh Aydin.

Additional information

Communicated by V.D. Tonchev.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Asamov, T., Aydin, N. A search algorithm for linear codes: progressive dimension growth. Des. Codes Cryptogr. 45, 213–217 (2007). https://doi.org/10.1007/s10623-007-9113-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-007-9113-2

Keywords

AMS Classification

Search

Navigation