Rank metric codes and zeta functions

  • I. Blanco-Chacón
  • E. Byrne
  • I. Duursma
  • J. Sheekey
Article

Abstract

We define the rank metric zeta function of a code as a generating function of its normalized q-binomial moments. We show that, as in the Hamming case, the zeta function gives a generating function for the weight enumerators of rank metric codes. We further prove a functional equation and derive an upper bound for the minimum distance in terms of the reciprocal roots of the zeta function. Finally, we show invariance under suitable puncturing and shortening operators and study the distribution of zeroes of the zeta function for a family of codes.

Keywords

Rank metric code Zeta function Weight enumerator Maximum-rank-distance Binomial moments Gaussian binomial coefficient 

Mathematics Subject Classification

11T71 94B05 94B27 94B60 94B65 94B99 

Notes

Acknowledgements

Blanco-Chacón was partially supported by the Science Foundation of Ireland (SFI 13/IA/1914), and the Spanish National Research Council (MTM2013-42135P). Duursma was partially supported by NSF (CCF-1619189).

References

  1. 1.
    Byrne E., Ravagnani, A.: Covering radius of matrix codes endowed with the rank metric. SIAM J. Discret. Math. 31(2), 927–944 (2017).Google Scholar
  2. 2.
    Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Combin. Theory Ser. A 25(3), 226–241 (1978).CrossRefMATHMathSciNetGoogle Scholar
  3. 3.
    Dumas J.-G., Gow R., McGuire G., Sheekey J.: Subspaces of matrices with special rank properties. Linear Algebra Appl. 433(1), 191–202 (2010).CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Duursma I.: From weight enumerators to zeta functions. Discret. Appl. Math. 111(1–2), 55–73 (2001).CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Duursma I.M.: Weight distributions of geometric Goppa codes. Trans. Am. Math. Soc. 351(9), 3609–3639 (1999).CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Duursma, I.M.: Combinatorics of the two-variable zeta function. In: Finite fields and applications. Lecture Notes in Computer Science, vol. 2948, pp. 109–136. Springer, Berlin (2004).Google Scholar
  7. 7.
    Gabidulin È.M.: Theory of codes with maximum rank distance. Probl. Peredachi Inf. 21(1), 3–16 (1985).MATHMathSciNetGoogle Scholar
  8. 8.
    Gadouleau M., Yan Z.: Macwilliams identity for the rank metric. CoRR, abs/cs/0701097 (2007).Google Scholar
  9. 9.
    Gasper G., Mizan R.: Basic Hypergeometric Series, Encyclopedia of Mathematics and Its Applications, vol. 96, 2nd edn. Cambridge University Press, Cambridge (2004).CrossRefMATHGoogle Scholar
  10. 10.
    Hartshorne R.: Algebraic Geometry. Springer, New York (1977). Graduate Texts in Mathematics, No. 52.Google Scholar
  11. 11.
    Koornwinder T.H.: Special functions and \(q\)-commuting variables. In: Special Functions. \(q\)-Series and Related Topics, Fields Institute Communications, pp. 109–136. American Mathematical Society, Rhode Island (1997).Google Scholar
  12. 12.
    Ravagnani A.: Rank-metric codes and their duality theory. Des. Codes Cryptogr. 80(1), 197–216 (2016).CrossRefMATHMathSciNetGoogle Scholar
  13. 13.
    Roth R.M.: Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inf. Theory 37(2), 328–336 (1991).CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.School of Mathematics and StatisticsUniversity College DublinDublinIreland
  2. 2.Department of MathematicsUniversity of Illinois Urbana-ChampaignChampaignUSA

Personalised recommendations