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

DOI10.1134/S0032946015030011zbMATH Open1367.94469OpenAlexW2135871648MaRDI QIDQ259876FDOQ259876

Authors: P. S. Rybin, V. V. 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

Recommendations

• Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
• Asymptotic Enumeration Methods for Analyzing LDPC Codes
• Performance of low-density parity-check codes with linear minimum distance
• Low-complexity error correction of Hamming-code-based LDPC codes
• On the error-correcting capability of LDPC codes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
• Asymptotic Enumeration Methods for Analyzing LDPC Codes
• Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity

This page was built for publication: Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q259876)