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, 2017, Volume 53, Issue 3, Pages 30–43 (Mi ppi2241)  
Coding Theory

A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices

F. I. Ivanov

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (200 kB)
References:
PDF
HTML
Abstract: We propose a new ensemble of binary low-density parity-check codes with paritycheck matrices based on repetition codes and permutation matrices. The proposed class of codes is a subensemble of quasi-cyclic codes. For the constructed ensemble, we obtain minimum distance estimates. We present simulation results for the proposed code constructions under the (Sum-Product) iterative decoding algorithm for transmission over an additive white Gaussian noise channel using binary phase-shift keying.
Funding agency Grant number
Russian Science Foundation 14-50-00150
The research was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences at the expense of the Russian Science Foundation, project no. 14-50-00150.
Received: 29.02.2016
Revised: 27.02.2017
English version:
Problems of Information Transmission, 2017, Volume 53, Issue 3, Pages 229–241
DOI: https://doi.org/10.1134/S0032946017030048
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: F. I. Ivanov, “A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices”, Probl. Peredachi Inf., 53:3 (2017), 30–43; Problems Inform. Transmission, 53:3 (2017), 229–241
Citation in format AMSBIB
\Bibitem{Iva17}
\by F.~I.~Ivanov
\paper A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices
\jour Probl. Peredachi Inf.
\yr 2017
\vol 53
\issue 3
\pages 30--43
\mathnet{http://mi.mathnet.ru/ppi2241}
\elib{https://elibrary.ru/item.asp?id=29966408}
\transl
\jour Problems Inform. Transmission
\yr 2017
\vol 53
\issue 3
\pages 229--241
\crossref{https://doi.org/10.1134/S0032946017030048}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000412936700004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85031757745}
Linking options:
  • https://www.mathnet.ru/eng/ppi2241
  • https://www.mathnet.ru/eng/ppi/v53/i3/p30
    • 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:208
    Full-text PDF :45
    References:44
    First page:15
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024