Skip to main content
SpringerLink
Log in

A Lower Bound on the Greedy Weights of Product Codes

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

Abstract

A greedy 1-subcode is a one-dimensional subcode of minimum (support) weight. A greedy r-subcode is an r-dimensional subcode with minimum support weight under the constraint that it contain a greedy (r - 1)-subcode. The r-th greedy weight e r is the support weight of a greedy r-subcode. The greedy weights are related to the weight hierarchy. We use recent results on the weight hierarchy of product codes to develop a lower bound on the greedy weights of product codes.

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

  1. W. Chen and T. Kløve, On the second greedy weight for binary linear codes, In M. Fossorier et al. (ed.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Vol. 1719 of Springer Lecture Notes in Computer Science, Springer-Verlag (1999) pp. 131-141.

  2. W. Chen and T. Kløve, On the second greedy weight for linear codes of dimension 3, Discrete Math., Vol. 241, No. 1-3 (2001) pp. 171-187.

    Google Scholar 

  3. G. D. Cohen, S. B. Encheva and G. Zémor, Antichain codes, Designs, Codes, and Cryptography, Vol. 18, No. 1-3 (1999) pp. 71-80.

    Google Scholar 

  4. T. Helleseth, T. Kløve and Ø. Ytrehus, Generalized Hamming weights of linear codes, IEEE Trans. Inform. Theory, Vol. 38, No. 3 (1992) pp. 1133-1140.

    Google Scholar 

  5. C. Martínez-Pérez and W. Willems, On the weight hierarchy of product codes, Preprint submitted to Designs, Codes, and Cryptography (2001).

  6. L. H. Ozarow and A. D. Wyner, Wire-tap channel II, AT&T Bell Laboratories Technical Journal, Vol. 63, No. 10 (December 1984) pp. 2135-2157.

    Google Scholar 

  7. H. G. Schaathun, The weight hierarchy of product codes, IEEE Trans. Inform. Theory, Vol. 46, No. 7 (November 2000) pp. 2648-2651.

    Google Scholar 

  8. H. G. Schaathun, Duality and greedy weights for linear codes and projective multisets, In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Springer Lecture Notes in Computer Science, Vol. 2227 Springer-Verlag (2001).

  9. H. G. Schaathun, Code constructions and higher weights, draft (2002).

  10. H. G. Schaathun and W. Willems, A lower bound for the weight hierarchies of product codes, Discrete Applied Mathematics, Vol. 128 (2003) pp. 251-261.

    Google Scholar 

  11. V. K. Wei, Generalized Hamming weights for linear codes, IEEE Trans. Inform. Theory, Vol. 37, No. 5 (1991) pp. 1412-1418.

    Google Scholar 

  12. V. K. Wei and K. Yang, On the generalized Hamming weights of product codes, IEEE Trans. Inform. Theory, Vol. 39, No. 5 (1993) pp. 1709-1713.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institutt for Informatikk, Universitas Bergensis, Høyteknologisenteret, N-5020, Bergen, Norway

    Hans Georg Schaathun

Authors
  1. Hans Georg Schaathun
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schaathun, H.G. A Lower Bound on the Greedy Weights of Product Codes. Designs, Codes and Cryptography 31, 27–42 (2004). https://doi.org/10.1023/A:1027382418978

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1027382418978

Search

Navigation