Skip to main content
SpringerLink
Log in

On the list decodability of rank-metric codes containing Gabidulin codes

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

Abstract

Wachter-Zeh (IEEE Trans Inf Theory 59(11):7268–7276, 2013), and later together with Raviv (IEEE Trans Inf Theory 62(4):1605–1615, 2016), proved that Gabidulin codes cannot be efficiently list decoded for any radius \(\tau \), providing that \(\tau \) is large enough. Also, they proved that there are infinitely many choices of the parameters for which Gabidulin codes cannot be efficiently list decoded at all. Subsequently, in Trombetti and Zullo (IEEE Trans Inf Theory 66(9):5379–5386, 2020) these results have been extended to the family of generalized Gabidulin codes and to further family of MRD-codes. In this paper, we provide bounds on the list size of rank-metric codes containing generalized Gabidulin codes in order to determine whether or not a polynomial-time list decoding algorithm exists. We detect several families of rank-metric codes containing a generalized Gabidulin code as subcode which cannot be efficiently list decoded for any radius large enough and families of rank-metric codes which cannot be efficiently list decoded. These results suggest that rank-metric codes which are \({{\mathbb {F}}}_{q^m}\)-linear or that contains a (power of) generalized Gabidulin code cannot be efficiently list decoded for large values of the radius.

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

Notes

  1. Here by \((\mathcal {G}_{m,k,\sigma })^{\sigma ^j}\) we mean the set \(\{f(x)^{\sigma ^j} :f(x) \in \mathcal {G}_{m,k,\sigma } \}\).

  2. \(A^T\) denotes the transpose of A.

References

  1. Bartoli D., Giulietti M., Marino G., Polverino O.: Maximum scattered linear sets and complete caps in Galois spaces. Combinatorica 38(2), 255–278 (2018).

    Article  MathSciNet  Google Scholar 

  2. Bartoli D., Zanella C., Zullo F.: A new family of maximum scattered linear sets in \({\rm PG}(1, q^6)\). Ars Math. Contemp. 19(1), 125–145 (2020).

    Article  MathSciNet  Google Scholar 

  3. Bartoli D., Zhou Y.: Asymptotics of Moore exponent sets. J. Comb. Theory Ser. A 175 (2020).

  4. Bombar M., Couvreur A.: Decoding supercodes of Gabidulin codes and applications to cryptanalysis, arXiv:2103.02700.

  5. Ben-Sasson E., Kopparty S., Radhakrishnan J.: Subspace polynomials and limits to list decoding of Reed-Solomon codes. IEEE Trans. Inf. Theory 56(1), 113–120 (2010).

    Article  MathSciNet  Google Scholar 

  6. Csajbók B., Marino G., Polverino O., Zanella C.: A new family of MRD-codes. Linear Algebra Appl. 548, 203–220 (2018).

    Article  MathSciNet  Google Scholar 

  7. Csajbók B., Marino G., Polverino O., Zullo F.: A characterization of linearized polynomials with maximum kernel. Finite Fields Appl. 5(6), 109–130 (2019).

    Article  MathSciNet  Google Scholar 

  8. Csajbók B., Marino G., Polverino O., Zhou Y.: Maximum rank-distance codes with maximum left and right idealisers. Discret. Math.343(9) (2020).

  9. Csajbók B., Marino G., Zullo F.: New maximum scattered linear sets of the projective line. Finite Fields Appl. 54, 133–150 (2018).

    Article  MathSciNet  Google Scholar 

  10. Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25, 226–241 (1978).

    Article  MathSciNet  Google Scholar 

  11. Elias P.: List decoding for noisy channels. In: Massachusetts Inst. Technol. Cambridge, MA, USA, Tech. Rep. 335 (1957).

  12. Gabidulin E.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21(3), 3–16 (1985).

    MathSciNet  MATH  Google Scholar 

  13. Giuzzi L., Zullo F.: Identifiers for MRD-codes. Linear Algebra Appl. 575, 66–86 (2019).

    Article  MathSciNet  Google Scholar 

  14. Gow R., Quinlan R.: Galois extensions and subspaces of alterning bilinear forms with special rank properties. Linear Algebra Appl. 430, 2212–2224 (2009).

    Article  MathSciNet  Google Scholar 

  15. Guruswami V.: Algorithmic Results in List Decoding. Now Publishers Inc., Boston (2006).

    Book  Google Scholar 

  16. Guruswami V., Wang C., Xing C.: Explicit list-decodable rank metric and subspace codes via subspace designs. IEEE Trans. Inf. Theory 62(5), 2707–2717 (2016).

    Article  MathSciNet  Google Scholar 

  17. Huang M., Kosters M., Petit C., Yeo S., Yun Y.: Quasi-subfield polynomials and the elliptic curve discrete logarithm problem. J. Math. Cryptol. 14(1), 25–38 (2020).

    Article  MathSciNet  Google Scholar 

  18. Justesen J., Hoholdt T.: Bounds on list decoding of MDS codes. IEEE Trans. Inf. Theory 47(4), 1604–1609 (2001).

    Article  MathSciNet  Google Scholar 

  19. Kadir W.K., Li C.: On decoding additive generalized twisted Gabidulin codes. Cryptogr. Commun. 12, 987–1009 (2020).

    Article  MathSciNet  Google Scholar 

  20. Kadir W.K., Li C., Zullo F.: On interpolation-based decoding of maximum rank distance codes. In: International Symposium on Information Theory, 2021. ISIT 2021. Proceedings.

  21. Koetter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54, 3579–3591 (2008).

    Article  MathSciNet  Google Scholar 

  22. Kshevetskiy A., Gabidulin E.: The new construction of rank codes. In: International Symposium on Information Theory, 2005. ISIT 2005. Proceedings, pp. 2105–2108 (2005).

  23. Lidl R., Niederreiter H.: Finite Fields, volume 20 of Encyclopedia of Mathematics and its Applications, 2nd ed.. Cambridge University Press, Cambridge (1997).

  24. Loidreau P.: A Welch-Berlekamp like algorithm for decoding Gabidulin codes. In: Coding and Cryptography. Springer, Berlin, pp. 36–45 (2006).

  25. Longobardi G., Marino G., Trombetti R., Zhou Y.: A large family of maximum scattered linear sets of PG\((1,q^n)\) and their associated MRD codes, arXiv:2102.08287.

  26. Longobardi G., Zanella C.: Linear sets and MRD-codes arising from a class of scattered linearized polynomials. J. Algebr. Comb. (2021). https://doi.org/10.1007/s10801-020-01011-9.

    Article  MathSciNet  MATH  Google Scholar 

  27. Lunardon G., Trombetti R., Zhou Y.: Generalized twisted Gabidulin codes. J. Comb. Theory Ser. A 159, 79–106 (2018).

    Article  MathSciNet  Google Scholar 

  28. Marino G., Montanucci M., Zullo F.: MRD-codes arising from the trinomial \(x^q + x^{q^3}+ cx^{q^5} \in \mathbb{F}_{q^6}[x]\). Linear Algebra Appl. 591, 99–114 (2020).

    Article  MathSciNet  Google Scholar 

  29. McGuire G., Mueller D.: Results on linearized trinomials having certain rank. In: Finite Fields and their Applications. De Gruyter, Berlin. https://doi.org/10.1515/9783110621730-010.

  30. McGuire G., Sheekey J.: A Characterization of the number of roots of linearized and projective polynomials in the field of coefficients. Finite Fields Appl. 57, 68–91 (2019).

    Article  MathSciNet  Google Scholar 

  31. Neri A., Santonastaso P., Zullo F.: Extending two families of maximum rank distance codes, arXiv:2104.07602.

  32. Otal K., Özbudak F.: Additive rank-metric codes. IEEE Trans. Inform. Theory 63, 164–168 (2017).

    Article  MathSciNet  Google Scholar 

  33. Puchinger S., Wachter-Zeh A.: Fast operations on linearized polynomials and their applications in coding theory. J. Symb. Comput. 89, 194–215 (2018).

    Article  MathSciNet  Google Scholar 

  34. Randrianarisoa T.H.: A decoding algorithm for rank metric codes, arXiv:1712.07060.

  35. Randrianarisoa T.H., Rosenthal J.: A decoding algorithm for twisted Gabidulin codes. In: IEEE International Symposium on Information Theory (ISIT), pp. 2771–2774 (2017).

  36. Raviv N., Wachter-Zeh A.: Some Gabidulin codes cannot be list decoded efficiently at any radius. IEEE Trans. Inf. Theory 62(4), 1605–1615 (2016).

    Article  MathSciNet  Google Scholar 

  37. Renner J., Jerkovits T., Bartz H., Puchinger S., Loidreau P., Wachter-Zeh A.: Randomized decoding of Gabidulin codes beyond the unique decoding radius. In: International Conference on Post-Quantum Cryptography. Springer, Cham (2020).

  38. Renner J., Puchinger S., Wachter-Zeh A.: LIGA: A cryptosystem based on the hardness of rank-metric list and interleaved decoding. Des. Codes Cryptogr. 89(6), 1279–1319 (2021).

    Article  MathSciNet  Google Scholar 

  39. Richter G., Plass S.: Error and erasure decoding of rank-codes with a modified Berlekamp-Massey algorithm. In: 5th International ITG Conference on Source and Channel Coding, pp. 249–256 (2004).

  40. Roth R.M.: Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inform. Theory 37(2), 328–336 (1991).

    Article  MathSciNet  Google Scholar 

  41. Santonastaso P., Zullo F.: Linearized trinomials with maximum kernel. J. Pure Appl. Algebra 226(3), 106842 (2022).

    Article  MathSciNet  Google Scholar 

  42. Sheekey J.: New semifields and new MRD codes from skew polynomial rings. J. Lond. Math. Soc. (2) 101(1), 432–456 (2020).

  43. Sheekey J.: MRD codes: constructions and connections. In: Schmidt K.-U., Winterhof A. (eds.) Combinatorics and Finite Fields: Difference Sets. Polynomials, Pseudorandomness and Applications, Radon Series on Computational and Applied Mathematics (2020).

    MATH  Google Scholar 

  44. Sheekey J.: A new family of linear maximum rank distance codes. Adv. Math. Commun. 10(3), 475–488 (2016).

    Article  MathSciNet  Google Scholar 

  45. Silva D., Kschischang F., Koetter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory 54(9), 3951–3967 (2008).

    Article  MathSciNet  Google Scholar 

  46. Trombetti R., Zhou Y.: A new family of MRD codes in \({\mathbb{F}}_q^{2n\times 2n}\) with right and middle nuclei \({\mathbb{F}}_{q^n}\). IEEE Trans. Inform. Theory 65(2), 1054–1062 (2019).

    Article  MathSciNet  Google Scholar 

  47. Trombetti R., Zullo F.: On the list decodability of rank metric codes. IEEE Trans. Inform. Theory 66(9), 5379–5386 (2020).

    Article  MathSciNet  Google Scholar 

  48. Wachter-Zeh A.: Bounds on list decoding of rank-metric codes. IEEE Trans. Inform. Theory 59(11), 7268–7276 (2013).

    Article  MathSciNet  Google Scholar 

  49. Wachter-Zeh A., Afanassiev V.B., Sidorenko V.R.: Fast decoding of Gabidulin codes. In: Int. Workshop Coding Cryptogr. (WCC) Paris France, pp. 433—442 (2011).

  50. Wachter-Zeh A., Afanassiev V.B., Sidorenko V.R.: Fast decoding of Gabidulin codes. Des. Codes Cryptogr. 66(1), 57–73 (2013).

    Article  MathSciNet  Google Scholar 

  51. Wachter-Zeh A., Sidorenko V.R., Bossert M.: A fast linearized euclidean algorithm for decoding Gabidulin codes. In: Int. Workshop Alg. Combin. Coding Theory (ACCT) Novosibirsk, Russia, pp. 298–303 (2010).

  52. Wozencraft J.M.: List decoding. In: Massachusetts Inst. Technol., Cambridge, MA, USA, Tech. Rep (1958).

Download references

Acknowledgements

We would like the anonymous referee for her/his valuable comments, which improves the quality of this paper. This research was supported by the Italian National Group for Algebraic and Geometric Structures and their Applications (GNSAGA - INdAM). The second author is also supported by the project “VALERE: VAnviteLli pEr la RicErca" of the University of Campania “Luigi Vanvitelli”.

Author information

Authors and Affiliations

  1. Dipartimento di Matematica e Fisica, Università degli Studi della Campania “Luigi Vanvitelli”, Viale Lincoln, 5, 81100, Caserta, Italy

    Paolo Santonastaso & Ferdinando Zullo

Authors
  1. Paolo Santonastaso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ferdinando Zullo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ferdinando Zullo.

Additional information

Communicated by G. McGuire.

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Santonastaso, P., Zullo, F. On the list decodability of rank-metric codes containing Gabidulin codes. Des. Codes Cryptogr. 90, 957–982 (2022). https://doi.org/10.1007/s10623-022-01022-6

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-022-01022-6

Keywords

Mathematics Subject Classification

Search

Navigation