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, 2009, Volume 45, Issue 2, Pages 25–40 (Mi ppi1976)  
This article is cited in 16 scientific papers (total in 16 papers)

Coding Theory

Low-complexity error correction of Hamming-code-based LDPC codes

V. V. Zyablova, R. Johannessonb, M. Lončarc

a A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
b Lund University, Sweden
c Nokia Corporation, Copenhagen, Denmark
Full-text PDF (304 kB) Citations (16)
References:
PDF
HTML
Abstract: Ensembles of binary random LDPC block codes constructed using Hamming codes as constituent codes are studied for communicating over the binary symmetric channel. These ensembles are known to contain codes that asymptotically almost meet the Gilbert–Varshamov bound. It is shown that in these ensembles there exist codes which can correct a number of errors that grows linearly with the code length, when decoded with a low-complexity iterative decoder, which requires a number of iterations that is a logarithmic function of the code length. The results are supported by numerical examples, for various choices of the code parameters.
Received: 03.03.2008
Revised: 24.02.2009
English version:
Problems of Information Transmission, 2009, Volume 45, Issue 2, Pages 95–109
DOI: https://doi.org/10.1134/S0032946009020021
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: V. V. Zyablov, R. Johannesson, M. Lončar, “Low-complexity error correction of Hamming-code-based LDPC codes”, Probl. Peredachi Inf., 45:2 (2009), 25–40; Problems Inform. Transmission, 45:2 (2009), 95–109
Citation in format AMSBIB
\Bibitem{ZyaJohLon09}
\by V.~V.~Zyablov, R.~Johannesson, M.~Lon{\v{c}}ar
\paper Low-complexity error correction of Hamming-code-based LDPC codes
\jour Probl. Peredachi Inf.
\yr 2009
\vol 45
\issue 2
\pages 25--40
\mathnet{http://mi.mathnet.ru/ppi1976}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2554705}
\zmath{https://zbmath.org/?q=an:1173.94451}
\transl
\jour Problems Inform. Transmission
\yr 2009
\vol 45
\issue 2
\pages 95--109
\crossref{https://doi.org/10.1134/S0032946009020021}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000268246600002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-67749104169}
Linking options:
  • https://www.mathnet.ru/eng/ppi1976
  • https://www.mathnet.ru/eng/ppi/v45/i2/p25
    • This publication is cited in the following 16 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:632
    Full-text PDF :167
    References:61
    First page:15
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024