Skip to main content
Log in

The weight spectrum of certain affine Grassmann codes

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

Abstract

We consider the linear code corresponding to a special affine part of the Grassmannian \({G_{2,m}}\), which we denote by \({C^{\mathcal {A}}(2, m)}\). This affine part is the complement of the Schubert divisor of \({G_{2,m}}\). In view of this, we show that there is a projection of Grassmann code onto the affine Grassmann code which is also a linear isomorphism. This implies that the dimensions of Grassmann codes and affine Grassmann codes are equal. The projection gives a 1–1 correspondence between codewords of Grassmann codes and affine Grassmann codes. Using this isomorphism and the correspondence between codewords, we give a skew–symmetric matrix in some standard block form corresponding to every codeword of \({C^{\mathcal {A}}(2, m)}\). The weight of a codeword is given in terms of the rank of some blocks of this form and it is shown that the weight of every codeword is divisible by some power of q. We also count the number of skew–symmetric matrices in the block form to compute the weight spectrum of the affine Grassmann code \({C^{\mathcal {A}}(2, m)}\).

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Beelen P., Ghorpade S.R., Høholdt T.: Affine Grassmann codes. IEEE Trans. Inf. Theory 56, 3166–3176 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  2. Beelen P., Ghorpade S.R., Høholdt T.: Duals of affine Grassmann codes and their relatives. IEEE Trans. Inf. Theory 58, 3843–3855 (2012).

    Article  MathSciNet  MATH  Google Scholar 

  3. Chen H.: On the minimum distance of Schubert codes. IEEE Trans. Inf. Theory 46, 1535–1538 (2000).

    Article  MathSciNet  MATH  Google Scholar 

  4. Ghorpade S.R., Lachaud G.: Higher weights of Grassmann codes. In: Buchmann J., Hoeholdt T., Stichtenoth H., Tapia-Recillas H. (eds.) Coding Theory, Cryptography and Related Areas (Guanajuato, 1998), pp. 122–131. Springer, Berlin (2000).

    Chapter  Google Scholar 

  5. Ghorpade S.R., Singh P.: Minimum distance and the minimum weight codewords of Schubert codes. Finite Fields Appl. 49, 1–28 (2018).

    Article  MathSciNet  MATH  Google Scholar 

  6. Ghorpade S.R., Tsfasman M.A.: Schubert varieties, linear codes and enumerative combinatorics. Finite Fields Appl. 11, 684–699 (2005).

    Article  MathSciNet  MATH  Google Scholar 

  7. Guerra L., Vincenti R.: On the linear codes arising from Schubert varieties. Des. Codes Cryptogr. 33, 173–180 (2004).

    Article  MathSciNet  MATH  Google Scholar 

  8. Kaipa K., Pillai H.: Weight spectrum of codes associated with the Grassmannian \(G(3,7)\). IEEE Trans. Inf. Theory 59, 983–993 (2013).

    Article  MathSciNet  MATH  Google Scholar 

  9. Lang S.: Algebra. Graduate Texts in Mathematics, vol. 211. Springer, New York (2002).

    Google Scholar 

  10. Nogin D.Yu.: Codes associated to Grassmannians. In: Pellikaan R., Perret M., Vlăduţ S.G. (eds.) Arithmetic, Geometry and Coding Theory (Luminy, 1993), pp. 145–154. Walter de Gruyter, Berlin (1996).

  11. Nogin D.Yu.: The spectrum of codes associated with the Grassmannian variety \(G(3,6)\). Probl. Inf. Transm. 33, 114–123 (1997).

  12. Piñero F.: The structure of dual Schubert Union Codes. IEEE Trans. Inf. Theory 63, 1425–1433 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  13. Piñero F., Singh P.: A note on the weight distribution of Schubert codes. Des. Codes Cryptogr. (2018). https://doi.org/10.1007/s10623-018-0477-2.

  14. Ryan C.T.: An application of Grassmann varieties to coding theory. Congr. Numer. 57, 257–271 (1987).

    MathSciNet  Google Scholar 

  15. Ryan C.T.: Projective codes based on Grassmann varieties. Congr. Numer. 57, 273–279 (1987).

    MathSciNet  MATH  Google Scholar 

  16. SageMath.: The Sage Mathematics Software System (Version 7.2.3). The Sage Developers. http://www.sagemath.org (2017).

  17. Tsfasman M., Vlăduţ S., Nogin D.: Algebraic Geometric Codes: Basic Notions, vol. 139. Math. Surv. Monogr.Amer. Math. Soc., Providence, RI (2007).

    Book  MATH  Google Scholar 

  18. Xiang X.: On the minimum distance conjecture for Schubert codes. IEEE Trans. Inf. Theory 54, 486–488 (2008).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

The first named author is very grateful for all the support received from the organizers of the fifth Irsee conference on Finite Geometries. The second named author would like to acknowledge H. C. Ørsted cofund postdoc fellowship for the project “Understanding Schubert Codes”. We are also grateful for the referees and their helpful comments which improved this article.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fernando Piñero.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Finite Geometries”.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Piñero, F., Singh, P. The weight spectrum of certain affine Grassmann codes. Des. Codes Cryptogr. 87, 817–830 (2019). https://doi.org/10.1007/s10623-018-0567-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-018-0567-1

Keywords

Mathematics Subject Classification

Navigation