Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

DOI10.1134/S0032946015030011zbMath1367.94469OpenAlexW2135871648MaRDI QIDQ259876

P. S. Rybin, Victor Zyablov

Publication date: 18 March 2016

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35) Error probability in coding theory (94B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
• Low-complexity error correction of Hamming-code-based LDPC codes
• Analysis of the relation between properties of LDPC codes and the Tanner graph
• Error Exponents of Expander Codes under Linear-Complexity Decoding
• Error exponents of expander codes