Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2011, Volume 47, Issue 2, Pages 38–51 (Mi ppi2044)  
This article is cited in 21 scientific papers (total in 21 papers)

Coding Theory

On (partial) unit memory codes based on Gabidulin codes

A. Wachtera, V. R. Sidorenkobc, M. Bosserta, V. V. Zyablovc

a Ulm University, Institute of Telecommunications and Applied Information Theory (TAIT), Germany
b Ulm University, Germany
c Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow
Full-text PDF (231 kB) Citations (21)
References:
PDF
HTML
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.
Received: 26.11.2010
Revised: 21.02.2011
English version:
Problems of Information Transmission, 2011, Volume 47, Issue 2, Pages 117–129
DOI: https://doi.org/10.1134/S0032946011020049
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: A. Wachter, V. R. Sidorenko, M. Bossert, V. V. Zyablov, “On (partial) unit memory codes based on Gabidulin codes”, Probl. Peredachi Inf., 47:2 (2011), 38–51; Problems Inform. Transmission, 47:2 (2011), 117–129
Citation in format AMSBIB
\Bibitem{WacSidBos11}
\by A.~Wachter, V.~R.~Sidorenko, M.~Bossert, V.~V.~Zyablov
\paper On (partial) unit memory codes based on Gabidulin codes
\jour Probl. Peredachi Inf.
\yr 2011
\vol 47
\issue 2
\pages 38--51
\mathnet{http://mi.mathnet.ru/ppi2044}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2857786}
\transl
\jour Problems Inform. Transmission
\yr 2011
\vol 47
\issue 2
\pages 117--129
\crossref{https://doi.org/10.1134/S0032946011020049}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000299375200004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80051696256}
Linking options:
  • https://www.mathnet.ru/eng/ppi2044
  • https://www.mathnet.ru/eng/ppi/v47/i2/p38
    • This publication is cited in the following 21 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:409
    Full-text PDF :107
    References:77
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024