Analysis of the relation between properties of LDPC codes and the Tanner graph

DOI10.1134/S0032946012040011zbMath1312.94117OpenAlexW1991705942MaRDI QIDQ1945141

P. S. Rybin, Victor Zyablov

Publication date: 3 April 2013

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946012040011

zbMATH Keywords

Tanner graphlow-density parity-check code

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Decoding (94B35)

Related Items (2)

Vectorizing computations at decoding of nonbinary codes with small density of checks ⋮ Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

Cites Work

• Unnamed Item
• Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
• On the error-correcting capability of LDPC codes
• Erasure correction by low-density codes
• A recursive approach to low complexity codes
• On the Number of Errors Correctable with Codes on Graphs
• Mathematical analysis of an iterative decoding algorithm for low-density codes

This page was built for publication: Analysis of the relation between properties of LDPC codes and the Tanner graph