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., 2013, Volume 49, Issue 4, Pages 41–56 (Mi ppi2122)  

This article is cited in 1 scientific paper (total in 1 paper)

Coding Theory

Low-density parity-check codes based on Steiner systems and permutation matrices

F. I. Ivanov, V. V. Zyablov

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

Abstract: An algorithm for generating parity-check matrices of regular low-density paritycheck codes based on permutation matrices and Steiner triple systems $S(v,3,2)$, $v=2^m-1$, is proposed. Estimations of the rate, minimum distance, and girth for obtained code constructions are presented. Results of simulation of the obtained code constructions for an iterative “belief propagation” (Sum-Product) decoding algorithm applied in the case of transmission over a binary channel with additive Gaussian white noise and BPSK modulation are presented.

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

English version:
Problems of Information Transmission, 2013, 49:4, 333–347

Bibliographic databases:

Document Type: Article
UDC: 621.391.15
Received: 15.05.2013
Revised: 27.08.2013

Citation: F. I. Ivanov, V. V. Zyablov, “Low-density parity-check codes based on Steiner systems and permutation matrices”, Probl. Peredachi Inf., 49:4 (2013), 41–56; Problems Inform. Transmission, 49:4 (2013), 333–347

Citation in format AMSBIB
\Bibitem{IvaZya13}
\by F.~I.~Ivanov, V.~V.~Zyablov
\paper Low-density parity-check codes based on Steiner systems and permutation matrices
\jour Probl. Peredachi Inf.
\yr 2013
\vol 49
\issue 4
\pages 41--56
\mathnet{http://mi.mathnet.ru/ppi2122}
\transl
\jour Problems Inform. Transmission
\yr 2013
\vol 49
\issue 4
\pages 333--347
\crossref{https://doi.org/10.1134/S0032946013040042}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000330766500004}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84898014029}


Linking options:
  • http://mi.mathnet.ru/eng/ppi2122
  • http://mi.mathnet.ru/eng/ppi/v49/i4/p41

    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. Gershgorin R.A., Rubanov L.I., Seliverstov A.V., “Easily Computable Invariants For Hypersurface Recognition”, J. Commun. Technol. Electron., 60:12 (2015), 1429–1431  crossref  isi  elib  scopus
  • Проблемы передачи информации Problems of Information Transmission
    Number of views:
    This page:250
    Full text:27
    References:23
    First page:14

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