Loading [MathJax]/jax/output/SVG/config.js
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, 2013, Volume 49, Issue 4, Pages 41–56 (Mi ppi2122)  
This article is cited in 2 scientific papers (total in 2 papers)

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
Full-text PDF (422 kB) Citations (2)
References:
PDF
HTML
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.
Received: 15.05.2013
Revised: 27.08.2013
English version:
Problems of Information Transmission, 2013, Volume 49, Issue 4, Pages 333–347
DOI: https://doi.org/10.1134/S0032946013040042
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
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{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000330766500004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84898014029}
Linking options:
  • https://www.mathnet.ru/eng/ppi2122
  • https://www.mathnet.ru/eng/ppi/v49/i4/p41
    • This publication is cited in the following 2 articles:
    1. Goldwyn Millar, Michel Kulhandjian, Ayse Alaca, Saban Alaca, Claude D'Amours, Halim Yanikomeroglu, “Low-Density Spreading Design Based on an Algebraic Scheme for NOMA Systems”, IEEE Wireless Commun. Lett., 11:4 (2022), 698  crossref
    2. 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
    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:544
    Full-text PDF :128
    References:68
    First page:14
     
      Contact us:
    math-net2025_04@mi-ras.ru     		 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025