Skip to main content

About the nth-Root Codes: a Gröbner Basis Approach to the Weight Computation

  • Chapter
  • First Online:
Gröbner Bases, Coding, and Cryptography

Abstract

Recently some methods have been proposed to find the distance and weight distribution of cyclic codes using Gröbner bases (Sala in Appl. Algebra Engrg. Comm. Comput. 13(2):137–162, 2002; Mora and Sala in J. Symbolic Comput. 35(2):177–194, 2003). We identify a class of codes for which these methods can be generalized. We show that this class contains all interesting linear codes (i.e., with d≥2) and we provide variants and improvements.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • D. Augot, E. Betti, and E. Orsini, An introduction to linear and cyclic codes, this volume, 2009, pp. 47–68.

    Google Scholar 

  • M. Giorgetti, On some algebraic interpretation of classical codes, Ph.D. thesis, University of Milan, 2006.

    Google Scholar 

  • M. Giorgetti and M. Sala, A commutative algebra approach to linear codes, BCRI preprint, www.bcri.ucc.ie, 58, UCC, Cork, Ireland, 2006.

  • M. Giorgetti and M. Sala, A commutative algebra approach to linear codes, Journal of Algebra 321 (2009), no. 8, 2259–2286.

    Article  MathSciNet  MATH  Google Scholar 

  • T. Mora, Gröbner technology, this volume, 2009, pp. 11–25.

    Google Scholar 

  • T. Mora and E. Orsini, Decoding cyclic codes: the Cooper philosophy, this volume, 2009, pp. 69–91.

    Google Scholar 

  • T. Mora and M. Sala, On the Gröbner bases of some symmetric systems and their application to coding theory, J. Symbolic Comput. 35 (2003), no. 2, 177–194.

    Article  MathSciNet  MATH  Google Scholar 

  • M. Sala, Gröbner bases and distance of cyclic codes, Appl. Algebra Engrg. Comm. Comput. 13 (2002), no. 2, 137–162.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marta Giorgetti .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Giorgetti, M. (2009). About the nth-Root Codes: a Gröbner Basis Approach to the Weight Computation. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds) Gröbner Bases, Coding, and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_20

Download citation

Publish with us

Policies and ethics