RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
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., 2000, Volume 36, Issue 4, Pages 35–46 (Mi ppi492)  

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

Information Theory

Mathematical Analysis of an Iterative Decoding Algorithm for Low-Density Codes

K. Sh. Zigangirov, M. Lentmaier


Abstract: A two-phase iterative decoding algorithm for low-density (LD) codes suggested by the authors of the paper is analyzed for transmission over a binary symmetric channel (BSC). A lower bound on the maximal error probability $p$ of the BSC for which the decoding error probability of iterative decoding goes to zero as the code length goes to infinity is derived.

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

English version:
Problems of Information Transmission, 2000, 36:4, 314–324

Bibliographic databases:

UDC: 621.391.15
Received: 10.02.2000

Citation: K. Sh. Zigangirov, M. Lentmaier, “Mathematical Analysis of an Iterative Decoding Algorithm for Low-Density Codes”, Probl. Peredachi Inf., 36:4 (2000), 35–46; Problems Inform. Transmission, 36:4 (2000), 314–324

Citation in format AMSBIB
\Bibitem{ZigLen00}
\by K.~Sh.~Zigangirov, M.~Lentmaier
\paper Mathematical Analysis of an Iterative Decoding Algorithm for Low-Density Codes
\jour Probl. Peredachi Inf.
\yr 2000
\vol 36
\issue 4
\pages 35--46
\mathnet{http://mi.mathnet.ru/ppi492}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1813650}
\zmath{https://zbmath.org/?q=an:1010.94017}
\transl
\jour Problems Inform. Transmission
\yr 2000
\vol 36
\issue 4
\pages 314--324


Linking options:
  • http://mi.mathnet.ru/eng/ppi492
  • http://mi.mathnet.ru/eng/ppi/v36/i4/p35

    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. D. V. Trukhachev, M. Lentmaier, K. Sh. Zigangirov, “Some Results Concerning the Design and Decoding of Turbo-Codes”, Problems Inform. Transmission, 37:3 (2001), 190–205  mathnet  crossref  mathscinet  zmath
    2. M. Lentmaier, D. V. Trukhachev, K. Sh. Zigangirov, “To the Theory of Low-Density Convolutional Codes. II”, Problems Inform. Transmission, 37:4 (2001), 288–306  mathnet  crossref  mathscinet  zmath
    3. Zigangirov K.S., Lentmaier M., Truhachev D., “Two approaches to the analysis of low-density parity-check codes”, ISIT: 2002 IEEE International Symposium on Information Theory, Proceedings, 2002, 29–29  crossref  isi
    4. Wintzell O., Lentmaier M., Zigangirov K.S., “On the asymptotic analysis of superorthogonal turbo codes”, IEEE International Symposium on Information Theory, Proceedings, 2002, 85–85  crossref  isi
    5. Wintzell, O, “Asymptotic analysis of superorthogonal turbo codes”, IEEE Transactions on Information Theory, 49:1 (2003), 253  crossref  mathscinet  zmath  isi
    6. Lentmaier, M, “An analysis of the block error probability performance of iterative decoding”, IEEE Transactions on Information Theory, 51:11 (2005), 3834  crossref  mathscinet  zmath  isi
    7. Pittermann J. Lentmaier M. Zigangirov K., “On Coded Modulation Using Ldpc Convolutional Codes”, AEU-Int. J. Electron. Commun., 59:4 (2005), 254–257  crossref  isi
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:268
    Full text:88
    References:14

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