Login / Signup

Improved bounds on the size of sparse parity check matrices.

Assaf NaorJacques Verstraëte
Published in: ISIT (2005)
Keyphrases
  • parity check
  • sparse matrix
  • upper bound
  • lower bound
  • coefficient matrix
  • computational complexity
  • sparse representation
  • low complexity
  • worst case bounds
  • worst case
  • singular value decomposition