Pages that link to "Item:Q1945141"
From MaRDI portal
The following pages link to Analysis of the relation between properties of LDPC codes and the Tanner graph (Q1945141):
Displaying 6 items.
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes (Q259876) (← 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)
- Detecting cycles of length 10 in the Tanner graph of a QC-LDPC code based on protograph analysis (Q2229575) (← links)
- Eliminating trapping sets in low-density parity-check codes by using Tanner graph covers (Q3604781) (← links)
- (Q4764215) (← links)