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., 1974, Volume 10, Issue 1, Pages 15–28 (Mi ppi1015)  

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

Coding Theory

Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures

V. V. Zyablov, M. S. Pinsker


Abstract: It is proved that low density codes of length $n$ exist with a decoding that corrects all erasures up to multiplicity on with a complexity of order $n\ln n$. It is shown that the ratio of $\alpha n$ to the code distance corresponding to the Varshamov–Gilbert bound has a lower bound varying from 0.33 to 0.66 as the transmission rate is increased from 0 to 1.

Full text: PDF file (1243 kB)

English version:
Problems of Information Transmission, 1974, 10:1, 10–21

Bibliographic databases:

UDC: 621.391.15
Received: 28.09.1972
Revised: 20.08.1973

Citation: V. V. Zyablov, M. S. Pinsker, “Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures”, Probl. Peredachi Inf., 10:1 (1974), 15–28; Problems Inform. Transmission, 10:1 (1974), 10–21

Citation in format AMSBIB
\Bibitem{ZyaPin74}
\by V.~V.~Zyablov, M.~S.~Pinsker
\paper Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures
\jour Probl. Peredachi Inf.
\yr 1974
\vol 10
\issue 1
\pages 15--28
\mathnet{http://mi.mathnet.ru/ppi1015}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=354157}
\zmath{https://zbmath.org/?q=an:0326.94011}
\transl
\jour Problems Inform. Transmission
\yr 1974
\vol 10
\issue 1
\pages 10--21


Linking options:
  • http://mi.mathnet.ru/eng/ppi1015
  • http://mi.mathnet.ru/eng/ppi/v10/i1/p15

    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. 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”, Problems Inform. Transmission, 42:2 (2006), 106–113  mathnet  crossref  mathscinet
    2. Zigangirov D.K., Zigangirov K.Sh., “On the erasure correction capability of LDPC codes”, 2006 IEEE International Symposium on Information Theory, 2006, 416–420  crossref  isi
    3. 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:468
    Full text:173
    First page:2

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