Skip to main content
SpringerLink
Log in

Error and erasure correcting algorithms for rank codes

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

Abstract

In this paper, transmitted signals are considered as square matrices of the Maximum rank distance (MRD) (n, k, d)-codes. A new composed decoding algorithm is proposed to correct simultaneously rank errors and rank erasures. If the rank of errors and erasures is not greater than the Singleton bound, then the algorithm gives always the correct decision. If it is not a case, then the algorithm gives still the correct solution in many cases but some times the unique solution may not exist.

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. Gabidulin E.M. (1985) Theory of codes with maximum rank distance. Probl. Inform. Transm. 21(1): 3–16

    MathSciNet  Google Scholar 

  2. Gabidulin E.M. (1985) Optimal codes correcting array errors. Probl. Inform. Transm. 21(2): 102–106

    MathSciNet  Google Scholar 

  3. Gabidulin E.M., Afanassiev V.B.: Coding in radio engineering. M.: Radio i swaz, 1986, 176 pp. (In Russian).

  4. Gabidulin E.M.: A fast matrix decoding algorithm for rank-error-correcting codes. In: Cohen G., Litsyn S., Lobstein A., Zemor G. (eds.) Lecture Notes in Computer Science vol 573. pp. 126–133 Springer-Verlag (1991).

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Paramonov A.V.: Channel coding and secure data transmission in parallel channels. Ph.D. thesis, Moscow Institute of Physics and Technology (MIPT), Moscow, pp. 1–139 (1992 in Russian).

  7. Richter G., Plass S.: Fast decoding of rank codes with rank errors and column erasures. In: Proceedings of 2004 IEEE International Symposium on Information Theory, ISIT’04, 2004.

  8. Loidreau P.: A Welch–Berlekamp like algorithm for decoding Gabidulin codes. In: Itrehus Ø. (ed.) Coding and Cryptography—WCC 2005, 4th International Workshop on Coding and Cryptography. LNCS, no. 3969, pp. 36–45. Springer (2006).

  9. Gabidulin E.M., Paramonov A.V., Tretjakov O.V.: Rank errors and rank erasures correction. In: Proceedings of the 4th International Colloquium on Coding Theory, Dilijan, Armenia, 30 Sept.–7 Oct. 1991, pp. 11–19. Yerevan (1992).

  10. Pilipchuk N.I., Gabidulin E.M.: Decoding of symmetric rank codes by information sets. In: Proceedings of the Tenth International Workshop, Algebraic and Combinatorial Coding Theory, September 3–9, Zvenigorod, Russia. pp. 214–219 (2006).

  11. Kshevetskiy A.: Information set decoding for codes in rank metric. In: Proceedings of the Ninth International Workshop, Algebraic and Combinatorial Coding Theory, June 19–25, Kranevo, Bulgaria. pp. 254–259 (2004).

  12. Gabidulin E.M., Pilipchuk N.I.(2004) Symmetric rank codes. Prob. Inform. Transm. 40(2): 3–18

    MathSciNet  Google Scholar 

  13. Gabidulin E.M., Pilipchuk N.I. (2006) Symmetric matrices and correcting rank errors beyond (d−1)/2 bound. Discrete Appl. Math. 154: 305–312

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow Institute of Physics and Technology, State University, 141700, Dolgoprudny, Russia

    Ernst M. Gabidulin & Nina I. Pilipchuk

Authors
  1. Ernst M. Gabidulin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nina I. Pilipchuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nina I. Pilipchuk.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gabidulin, E.M., Pilipchuk, N.I. Error and erasure correcting algorithms for rank codes. Des. Codes Cryptogr. 49, 105–122 (2008). https://doi.org/10.1007/s10623-008-9185-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-008-9185-7

Keywords

AMS Classification

Search

Navigation