scientific article; zbMATH DE number 3559420
From MaRDI portal
Publication:4132387
Recommendations
Cited in
(16)- Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes
- Analysis of the relation between properties of LDPC codes and the Tanner graph
- Error-correcting codes on low rank surfaces
- scientific article; zbMATH DE number 5953455 (Why is no real title available?)
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition
- Average and reliability error exponents in low-density parity-check codes
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel
- Low-complexity error correction of Hamming-code-based LDPC codes
- Complexity of constructing codes with specified correction properties
- On the error-correcting capability of LDPC codes
- Erasure correction by low-density codes
- A note on the decoding complexity of error-correcting codes
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
- Vectorizing computations at decoding of nonbinary codes with small density of checks
- Decoding concatenated codes with inner convolutional codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4132387)
