Skip to main content
added 86 characters in body; edited tags
Source Link
Alexey Ustinov
  • 12.3k
  • 7
  • 87
  • 119

According to Google Scholar original Gallager's article Low-density parity-check codes is cited more than 10000 times. It looks scary for non-experts.

I suspect that the number of algorithms for constructing good sparse matrices for LDPC-codes is much less than 10000. Is there any survey which contains description of such algorithms?

Basically I'm interested in explicit constructions based on number theory methods.

According to Google Scholar original Gallager's article Low-density parity-check codes is cited more than 10000 times. It looks scary for non-experts.

I suspect that the number of algorithms for constructing good sparse matrices for LDPC-codes is much less than 10000. Is there any survey which contains description of such algorithms?

According to Google Scholar original Gallager's article Low-density parity-check codes is cited more than 10000 times. It looks scary for non-experts.

I suspect that the number of algorithms for constructing good sparse matrices for LDPC-codes is much less than 10000. Is there any survey which contains description of such algorithms?

Basically I'm interested in explicit constructions based on number theory methods.

Source Link
Alexey Ustinov
  • 12.3k
  • 7
  • 87
  • 119

LDPC codes construction

According to Google Scholar original Gallager's article Low-density parity-check codes is cited more than 10000 times. It looks scary for non-experts.

I suspect that the number of algorithms for constructing good sparse matrices for LDPC-codes is much less than 10000. Is there any survey which contains description of such algorithms?