Pages that link to "Item:Q2577283"
From MaRDI portal
The following pages link to On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices (Q2577283):
Displaying 6 items.
- Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel (Q415651) (← links)
- Vectorizing computations at decoding of nonbinary codes with small density of checks (Q507108) (← links)
- On the error-correcting capability of LDPC codes (Q734256) (← links)
- A special class of quasi-cyclic low-density parity-check codes based on repetition codes and permutation matrices (Q1752308) (← links)
- A lower bound on permutation codes of distance \(n-1\) (Q2285776) (← links)
- Minimum distance computation of linear codes via genetic algorithms with permutation encoding (Q4630314) (← links)