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

DOI10.1134/S0032946010020043zbMath1237.94145OpenAlexW2050612395MaRDI QIDQ415716

Victor Zyablov, Alexey Frolov

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

Mathematics Subject Classification ID

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

Related Items (5)

Analysis of the relation between properties of LDPC codes and the Tanner graph ⋮ Vectorizing computations at decoding of nonbinary codes with small density of checks ⋮ On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\) ⋮ Generalized error-locating codes with component codes over a single alphabet ⋮ Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes

Cites Work

• A recursive approach to low complexity codes
• Unnamed Item
• Unnamed Item

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