Revision as of 07:39, 21 October 2009 edit Cunchem (talk \| contribs) 52 edits →@ User:78.42.25.227 ← Previous edit		Revision as of 07:41, 21 October 2009 edit undo SineBot (talk \| contribs) Bots 2,564,779 edits m Signing comment by Cunchem - "→@ User:78.42.25.227: " Next edit →
Line 215: 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) :Oups I just reverted the change before reading your post ... Maybe it is a way to represent or implement the iterative decoding, and in this case it should be justified. <small><span class="autosigned">—Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[User:Cunchem\|Cunchem]] ([[User talk:Cunchem\|talk]] • [[Special:Contributions/Cunchem\|contribs]]) 07:39, 21 October 2009 (UTC)</span></small><!-- Template:Unsigned --> <!--Autosigned by SineBot-->

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