Content deleted Content added
No edit summary |
No edit summary |
||
Line 188:
::::: All linear block codes may be modeled as bipartite graphs, sure. But the point is: how do you construct the codes? If you take the graph approach, this is what would be called LDPC codes. Other codes, e.g. RS codes, take other approaches, such as polynomial interpolation.
::::: I agree with you regarding MDPC. As I said before, it seems very stretched to view MDPC codes as constructed via bipartite graphs, since the original intention was likely simply to compute single parity bits over rows and columns in a hypercube. I suggest leaving mentioning MDPC codes out, or otherwise, if there is an appropriate place (subjective) in the article, then it should only say that "MDPC codes ''may'' be viewed as simple regular LDPC codes".
::::: Edit: I rather vote for removing the reference to MDPC codes.
::::: [[User:Nageh|Nageh]] ([[User talk:Nageh|talk]]) 16:59, 8 June 2009 (UTC)
|