Login / Signup

An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices.

Eirik RosnesØyvind Ytrehus
Published in: IEEE Trans. Inf. Theory (2009)
Keyphrases
  • small size
  • computational complexity
  • np hard
  • single pass
  • image compression