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


Probl. Peredachi Inf., 2006, Volume 42, Issue 2, Pages 44–52 (Mi ppi42)  

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

Coding Theory

Decoding of Low-Density Codes with Parity-Check Matrices Composed of Permutation Matrices, Used for Transmission over an Erasure Channel

D. K. Zinangirova, K. Sh. Zigangirov

a Institute for Information Transmission Problems, Russian Academy of Sciences

Abstract: A lower bound for the number of iteratively correctable erasures is given, with application to the ensemble of LDPC codes with parity-check matrices composed of permutation matrices [1]. We assume that the Zyablov–Pinsker iterative decoding algorithm [2] is used. Its complexity is $O(Nlog N)$, where $N$ is the block length.

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

English version:
Problems of Information Transmission, 2006, 42:2, 106–113

Bibliographic databases:

UDC: 621.391.15
Received: 29.09.2005
Revised: 14.11.2005

Citation: D. K. Zinangirov, K. Sh. Zigangirov, “Decoding of Low-Density Codes with Parity-Check Matrices Composed of Permutation Matrices, Used for Transmission over an Erasure Channel”, Probl. Peredachi Inf., 42:2 (2006), 44–52; Problems Inform. Transmission, 42:2 (2006), 106–113

Citation in format AMSBIB
\Bibitem{ZinZig06}
\by D.~K.~Zinangirov, K.~Sh.~Zigangirov
\paper Decoding of Low-Density Codes with Parity-Check Matrices Composed of Permutation Matrices, Used for Transmission over an Erasure Channel
\jour Probl. Peredachi Inf.
\yr 2006
\vol 42
\issue 2
\pages 44--52
\mathnet{http://mi.mathnet.ru/ppi42}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2232888}
\transl
\jour Problems Inform. Transmission
\yr 2006
\vol 42
\issue 2
\pages 106--113
\crossref{https://doi.org/10.1134/S0032946006020049}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-33745840177}


Linking options:
  • http://mi.mathnet.ru/eng/ppi42
  • http://mi.mathnet.ru/eng/ppi/v42/i2/p44

    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. K. Sh. Zigangirov, A. E. Pusane, D. K. Zinangirov, D. J. Costello, “On the Error-Correcting Capability of LDPC Codes”, Problems Inform. Transmission, 44:3 (2008), 214–225  mathnet  crossref  mathscinet  zmath  isi
    2. V. V. Zyablov, P. S. Rybin, “Erasure correction by low-density codes”, Problems Inform. Transmission, 45:3 (2009), 204–220  mathnet  crossref  mathscinet  zmath  isi
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:579
    Full text:191
    References:47
    First page:8

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