Revision as of 11:44, 8 June 2009 edit Nageh (talk \| contribs) Pending changes reviewers, Rollbackers 6,862 edits No edit summary ← Previous edit		Revision as of 14:54, 8 June 2009 edit undo Cunchem (talk \| contribs) 52 edits →Start again Next edit →
Line 177: :::[[User:Nageh\|Nageh]] ([[User talk:Nageh\|talk]]) 11:44, 8 June 2009 (UTC) :::: does "sqrt_d(k) ones per column" makes a matrix sparse? :::: I think that LDPC are also characterized by there ability to be efficiently decoded by a low complexity iterative decoding algorithm. [[User:Cunchem\|Cunchem]] ([[User talk:Cunchem\|talk]]) 14:54, 8 June 2009 (UTC) :Regarding randomness, I do not recall randomness being a central criterion in the definition of LDPC codes; in fact, you could very well construct low-density parity check matrices algebraically and deterministically, it's just that randomized constructions turn out to be superior.

Talk:Low-density parity-check code: Difference between revisions