RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor

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


Probl. Peredachi Inf., 2010, Volume 46, Issue 4, Pages 33–55 (Mi ppi2025)  

This article is cited in 3 scientific papers (total in 3 papers)

Coding Theory

Decoding of random network codes

E. M. Gabidulina, N. I. Pilipchuka, M. Bossertb

a Moscow Institute of Physics and Technology
b Ulm University, Germany

Abstract: We consider the decoding for Silva–Kschischang–Kötter random network codes based on Gabidulin's rank-metric codes. The model of a random network coding channel can be reduced to transmitting matrices of a rank code through a channel introducing three types of additive errors. The first type is called random rank errors. To describe other types, the notions of generalized row erasures and generalized column erasures are introduced. An algorithm for simultaneous correction of rank errors and generalized erasures is presented. An example is given.

Full text: PDF file (309 kB)
References: PDF file   HTML file

English version:
Problems of Information Transmission, 2010, 46:4, 300–320

Bibliographic databases:

UDC: 621.391.15
Received: 14.05.2010
Revised: 27.09.2010

Citation: E. M. Gabidulin, N. I. Pilipchuk, M. Bossert, “Decoding of random network codes”, Probl. Peredachi Inf., 46:4 (2010), 33–55; Problems Inform. Transmission, 46:4 (2010), 300–320

Citation in format AMSBIB
\Bibitem{GabPilBos10}
\by E.~M.~Gabidulin, N.~I.~Pilipchuk, M.~Bossert
\paper Decoding of random network codes
\jour Probl. Peredachi Inf.
\yr 2010
\vol 46
\issue 4
\pages 33--55
\mathnet{http://mi.mathnet.ru/ppi2025}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2791045}
\transl
\jour Problems Inform. Transmission
\yr 2010
\vol 46
\issue 4
\pages 300--320
\crossref{https://doi.org/10.1134/S0032946010040034}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000286328800003}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-79952645588}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2025
  • http://mi.mathnet.ru/eng/ppi/v46/i4/p33

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. E. M. Gabidulin, N. I. Pilipchuk, “Rank subcodes in multicomponent network coding”, Problems Inform. Transmission, 49:1 (2013), 40–53  mathnet  crossref  isi
    2. E. M. Gabidulin, N. I. Pilipchuk, B. Honary, H. Rashwan, “Information security in a random network coding network”, Problems Inform. Transmission, 49:2 (2013), 179–191  mathnet  crossref  isi
    3. Gluesing-Luerssen H., Morrison K., Troha C., “Cyclic Orbit Codes and Stabilizer Subfields”, Adv. Math. Commun., 9:2 (2015), 177–197  crossref  mathscinet  zmath  isi  elib
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:556
    Full text:122
    References:43
    First page:18

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020