The following pages link to (Q4132387):
Displayed 11 items.
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes (Q259876) (← links)
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel (Q415651) (← links)
- Asymptotic estimation of the fraction of errors correctable by \(q\)-ary LDPC codes (Q415716) (← links)
- Vectorizing computations at decoding of nonbinary codes with small density of checks (Q507108) (← links)
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\) (Q514531) (← links)
- On the error-correcting capability of LDPC codes (Q734256) (← links)
- Low-complexity error correction of Hamming-code-based LDPC codes (Q734298) (← links)
- Erasure correction by low-density codes (Q1049386) (← links)
- Decoding concatenated codes with inner convolutional codes (Q1280739) (← links)
- Analysis of the relation between properties of LDPC codes and the Tanner graph (Q1945141) (← links)
- Exploiting coding theory for classification: an LDPC-based strategy for multiclass-to-binary decomposition (Q2279665) (← links)