Skip to main content
SpringerLink
Log in

On (Partial) unit memory codes based on Gabidulin codes

  • Coding Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

(Partial) unit memory ((P)UM) codes provide a powerful possibility to construct convolutional codes based on block codes in order to achieve a high decoding performance. In this contribution, a construction based on Gabidulin codes is considered. This construction requires a modified rank metric, the so-called sum rank metric. For the sum rank metric, the free rank distance, extended row rank distance, and its slope are defined analogous to the extended row distance in the Hamming metric. Upper bounds for the free rank distance and slope of (P)UM codes in the sum rank metric are derived, and an explicit construction of (P)UM codes based on Gabidulin codes is given.

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. Lee, L.-N., Short Unit-Memory Byte-Oriented Binary Convolutional Codes Having Maximal Free Distance, IEEE Trans. Inform. Theory, 1976, vol. 22, no. 3, pp. 349–352.

    Article  MATH  Google Scholar 

  2. Lauer, G.S., Some Optimal Partial-Unit Memory Codes, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 2, pp. 240–243.

    Article  MATH  Google Scholar 

  3. Zyablov, V. and Sidorenko, V., On Periodic (Partial) Unit Memory Codes with Maximum Free Distance, Error Control, Cryptology, and Speech Compression (Proc. Workshop on Information Protection, Moscow, Russia, 1993), Chmora, A. and Wicker, S.B., Eds., Lect. Notes Comp. Sci., vol. 829, Berlin: Springer, 1994, pp. 74–79.

    Google Scholar 

  4. Pollara, F., McEliece, R.J., and Abdel-Ghaffar, K., Finite-State Codes, IEEE Trans. Inform. Theory, 1988, vol. 34, no. 5, pp. 1083–1089.

    Article  MathSciNet  Google Scholar 

  5. Justesen, J., Bounded Distance Decoding of Unit Memory Codes, IEEE Trans. Inform. Theory, 1993, vol. 39, no. 5, pp. 1616–1627.

    Article  MATH  MathSciNet  Google Scholar 

  6. Dettmar, U. and Sorger, U., New Optimal Partial Unit Memory Codes Based on Extended BCH Codes, Electron. Lett., 1993, vol. 29, no. 23, pp. 2024–2025.

    Article  Google Scholar 

  7. Dettmar, U. and Shavgulidze, S., New Optimal Partial Unit Memory Codes, Electron. Lett., 1992, vol. 28, no. 18, pp. 1748–1749.

    Article  Google Scholar 

  8. Thommesen, C. and Justesen, J., Bounds on Distances and Error Exponents of Unit Memory Codes, IEEE Trans. Inform. Theory, 1983, vol. 29, no. 5, pp. 637–648.

    Article  MATH  MathSciNet  Google Scholar 

  9. Kötter, R. and Kschischang, F.R., Coding for Errors and Erasures in Random Network Coding, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 8, pp. 3579–3591.

    Article  MathSciNet  Google Scholar 

  10. Silva, D., Kschischang, F.R., and Kötter, R., A Rank-Metric Approach to Error Control in Random Network Coding, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 9, pp. 3951–3967.

    Article  MathSciNet  Google Scholar 

  11. Delsarte, P., Bilinear Forms over a Finite Field, with Applications to Coding Theory, J. Combin. Theory, Ser. A, 1978, vol. 25, no. 3, pp. 226–241.

    Article  MATH  MathSciNet  Google Scholar 

  12. Gabidulin, E.M., Theory of Codes with Maximum Rank Distance, Probl. Peredachi Inf., 1985, vol. 21, no. 1, pp. 3–16 [Probl. Inf. Trans. (Engl. Transl.), 1985, vol. 21, no. 1, pp. 1–12].

    MathSciNet  Google Scholar 

  13. Roth, R.M., Maximum-Rank Array Codes and Their Application to Crisscross Error Correction, IEEE Trans. Inform. Theory, 1991, vol. 37, no. 2, pp. 328–336.

    Article  MATH  MathSciNet  Google Scholar 

  14. Bocharova, I.E., Kudryashov, B.D., Bossert, M., and Sidorenko, V., Convolutional Rank Codes, Preprint, 2010.

  15. Nóbrega, R.W. and Uchôa-Filho, B.F., Multishot Codes for Network Coding Using Rank-Metric Codes, Computing Research Repository, 2010. Available at http://arxiv.org/abs/1001.2059.

  16. Lidl, R. and Niederreiter, H., Finite Fields, Cambridge: Cambridge Univ. Press, 1997, 2nd ed.

    Google Scholar 

  17. Johannesson, R. and Zigangirov, K.Sh., Fundamentals of Convolutional Coding, Piscataway, NJ: IEEE Press, 1999.

    Book  Google Scholar 

  18. Forney, G.D., Convolutional Codes I: Algebraic Structure, IEEE Trans. Inform. Theory, 1970, vol. 16, no. 6, pp. 720–738.

    Article  MATH  MathSciNet  Google Scholar 

  19. Dettmar, U., Partial Unit Memory Codes, PhD Thesis, Darmstadt: Univ. of Technology, 1994.

    Google Scholar 

  20. Dettmar, U. and Sorger, U.K., Bounded Minimum Distance Decoding of Unit Memory Codes, IEEE Trans. Inform. Theory, 1995, vol. 41, no. 2, pp. 591–596.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Telecommunications and Applied Information Theory (TAIT), Ulm University, Ulm, Germany

    A. Wachter & M. Bossert

  2. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    V. R. Sidorenko

  3. Ulm University, Ulm, Germany

    V. R. Sidorenko

  4. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

    V. V. Zyablov

Authors
  1. A. Wachter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. R. Sidorenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Bossert
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. V. V. Zyablov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. Wachter.

Additional information

Original Russian Text © A. Wachter, V.R. Sidorenko, M. Bossert, V.V. Zyablov, 2011, published in Problemy Peredachi Informatsii, 2011, Vol. 47, No. 2, pp. 38–51.

Supported in part by the DFG, Grant no. Bo867/21-1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wachter, A., Sidorenko, V.R., Bossert, M. et al. On (Partial) unit memory codes based on Gabidulin codes. Probl Inf Transm 47, 117–129 (2011). https://doi.org/10.1134/S0032946011020049

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946011020049

Keywords

Search

Navigation