Revision as of 01:28, 7 August 2009 edit Pfagerburg~enwiki (talk \| contribs) 761 edits →Capacity achieving?: thanks for the better introduction ← Previous edit		Revision as of 18:14, 20 October 2009 edit undo Nageh (talk \| contribs) Pending changes reviewers, Rollbackers 6,862 edits "probabilities" in the LDPC matrix for syndrome computation??? Next edit →
Line 211: :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. :[[User:Nageh\|Nageh]] ([[User talk:Nageh\|talk]]) 09:14, 8 June 2009 (UTC) == @ [[User:78.42.25.227]] == I am confused by your recent edit... In the parity-check matrix, there will be either 1's or 0's. The null space of the matrix defines the graph. I don't see why there should be "probabilities" in the matrix for syndrome computation. And syndrome computation tells you normally whether decoding was correct (syndrome is 0) or not (not 0). Please justify your edit (or anyone else), either on the talk page or as a reference, or I will revert your edit. Thanks, cheers, [[User:Nageh\|Nageh]] ([[User talk:Nageh\|talk]]) 18:14, 20 October 2009 (UTC)

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