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, 2020, Volume 56, Issue 4, Pages 19–34
DOI: https://doi.org/10.31857/S0555292320040038 (Mi ppi2326) 		 
This article is cited in 4 scientific papers (total in 4 papers)

Coding Theory

Detecting cycles of length $10$ in the Tanner graph of a QC-LDPC code based on protograph analysis

A. V. Kharin, K. N. Zavertkin, A. A. Ovinnikov

Department of Theoretical Foundations of Electrical Engineering, Faculty of Radio Engineering and Telecommunications, Utkin Ryazan State Radio Engineering University, Ryazan, Russia
Full-text PDF (310 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.31857/S0555292320040038
Abstract: We complete the description of the procedure of topological expansion of a bipartite graph without parallel branches on the plane of changing the structure of cycles of length up to $10$ inclusive. Based on previous papers, we have extended a set of theorems specifying transformation rules for cycles and paths when passing from a protograph to the Tanner graph. We propose a procedure for detecting the existence of a cycle of length $10$ in the expanded graph by analyzing the protograph.
Keywords: Tanner graph, protograph, expanded graph, union of cycles, base equation, extrinsic message degree, LDPC code.
Funding agency Grant number
Russian Science Foundation 17-79-20302
The research was carried out at the expense of the Russian Science Foundation, project no. 17-79-20302.
Received: 27.08.2020
Revised: 23.11.2020
Accepted: 23.11.2020
English version:
Problems of Information Transmission, 2020, Volume 56, Issue 4, Pages 317–331
DOI: https://doi.org/10.1134/S0032946020040031
Bibliographic databases:
Document Type: Article
UDC: 621.391 : 519.725
Language: Russian
Citation: A. V. Kharin, K. N. Zavertkin, A. A. Ovinnikov, “Detecting cycles of length $10$ in the Tanner graph of a QC-LDPC code based on protograph analysis”, Probl. Peredachi Inf., 56:4 (2020), 19–34; Problems Inform. Transmission, 56:4 (2020), 317–331
Citation in format AMSBIB
\Bibitem{KhaZavOvi20}
\by A.~V.~Kharin, K.~N.~Zavertkin, A.~A.~Ovinnikov
\paper Detecting cycles of length $10$ in the Tanner graph of a QC-LDPC code based on protograph analysis
\jour Probl. Peredachi Inf.
\yr 2020
\vol 56
\issue 4
\pages 19--34
\mathnet{http://mi.mathnet.ru/ppi2326}
\crossref{https://doi.org/10.31857/S0555292320040038}
\transl
\jour Problems Inform. Transmission
\yr 2020
\vol 56
\issue 4
\pages 317--331
\crossref{https://doi.org/10.1134/S0032946020040031}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000612377800003}
Linking options:
  • https://www.mathnet.ru/eng/ppi2326
  • https://www.mathnet.ru/eng/ppi/v56/i4/p19
    • This publication is cited in the following 4 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:99
    Full-text PDF :3
    References:18
    First page:11
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024