Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes

DOI10.1134/S0032946010020043zbMATH Open1237.94145OpenAlexW2050612395MaRDI QIDQ415716FDOQ415716

Authors: Alexey Frolov, V. V. Zyablov 

Publication date: 9 May 2012

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

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

Recommendations

• On the error-correcting capability of 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
• Erasure correction by low-density codes
• LP Decoding Corrects a Constant Fraction of Errors

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60) Error probability in coding theory (94B70)

Cites Work

• Title not available (Why is that?)
• A recursive approach to low complexity codes
• Title not available (Why is that?)

Cited In (8)

• Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
• Analytical Solution of Covariance Evolution for Irregular LDPC Codes
• Analysis of the relation between properties of LDPC codes and the Tanner graph
• Generalized error-locating codes with component codes over a single alphabet
• A study of error floor behavior in QC-MDPC codes
• Vectorizing computations at decoding of nonbinary codes with small density of checks
• On the error-correcting capability of LDPC codes
• On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)

This page was built for publication: Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes

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