Skip to main content
Springer Nature Link
Log in

Groebner Bases and Distance of Cyclic Codes

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract.

 Recently some methods have been proposed to find the distance of cyclic codes using Gröbner bases. We present a similar method, whose computational cost is significantly lower.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Pisa, Italy (e-mail: sala@mail.dm.unipi.it), , , , , , IT

    Massimiliano Sala

Authors
  1. Massimiliano Sala
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: April 24, 2001; revised version: February 14, 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sala, M. Groebner Bases and Distance of Cyclic Codes. AAECC 13, 137–162 (2002). https://doi.org/10.1007/s002000200096

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000200096

Keywords