Skip to main content

On Generalized Hamming Weights for Codes over Finite Chain Rings

  • Conference paper
  • First Online:
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2227))

Abstract

In this paper, we introduce the generalized Hamming weights with respect to rank (GHWR), from a module theoretical point of view, for linear codes over finite chain rings. We consider some basic properties of GHWR.

Research Fellow of the Japan Society for the Promotion of Science.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

  1. A. Ashikhmin, On generalized Hamming weights for Galois ring linear codes, Designs, Codes and Cryptography, 14 (1998) pp. 107–126.

    Article  MATH  MathSciNet  Google Scholar 

  2. S. T. Dougherty and K. Shiromoto, MDR codes over ZZk, IEEE Trans. Inform. Theory, 46 (2000) pp. 265–269.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane and P. Solé, The ZZ4-linearity of Kerdock, Preparata, Goethals and related codes, IEEE Trans. Inform. Theory, 40 (1994) pp. 301–319.

    Article  MATH  MathSciNet  Google Scholar 

  4. T. Helleseth and K. Yang, Further results on generalized Hamming weights for Goethals and Preparata codes over ZZ4, IEEE Trans. Inform. Theory, 45 (1999) pp. 1255–1258.

    Article  MATH  MathSciNet  Google Scholar 

  5. T. Honold and I. Landjev, Linear codes over finite chain rings, Electronic Journal of Combinatorics, 7 (2000), no. 1, Research Paper 11.

    Google Scholar 

  6. H. Horimoto and K. Shiromoto, A Singleton bound for linear codes over quasi-Frobenius rings, Proceedings of the 13th Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Hawaii, 1999).

    Google Scholar 

  7. H. Horimoto and K. Shiromoto, MDS codes over finite quasi-Frobenius rings, submitted.

    Google Scholar 

  8. B. R. McDonald, Finite rings with identity, Pure and Applied Mathematics, 28 Marcel Dekker, Inc., New York, 1974.

    Google Scholar 

  9. M. A. Tsfasman and S. G. Vladut, Geometric approach to higher weights, IEEE Trans. Inform. Theory, 41 (1995) pp. 1564–1588.

    Article  MATH  MathSciNet  Google Scholar 

  10. V. K. Wei, Generalized Hamming weights for linear codes, IEEE Trans. Inform. Theory, 37 (1991)pp. 1412–1418.

    Article  MATH  MathSciNet  Google Scholar 

  11. J. A. Wood, Duality for modules over finite rings and applications to coding theory, American journal of Mathematics, 121 (1999), 555–575.

    Article  MATH  MathSciNet  Google Scholar 

  12. K. Yang, T. Helleseth, P. V. Kumar and A. G. Shanbhang, On the weights hierarchy of Kardock codes over ZZ4. IEEE Trans. Inform. Theory, 42 (1996) pp. 1587–1593.

    Article  MATH  MathSciNet  Google Scholar 

  13. K. Yang and T. Helleseth, On the weight hierarchy of Preparata codes over ZZ4, IEEE Trans. Inform. Theory, 43 (1997) pp. 1832–1842.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Horimoto, H., Shiromoto, K. (2001). On Generalized Hamming Weights for Codes over Finite Chain Rings. In: BoztaÅŸ, S., Shparlinski, I.E. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2001. Lecture Notes in Computer Science, vol 2227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45624-4_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45624-4_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42911-1

  • Online ISBN: 978-3-540-45624-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics