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

Revision as of 17:54, 5 January 2020

Latest revision as of 05:21, 5 February 2024

(2 intermediate revisions by 2 users not shown)

Line 1:

{{oldpeerreview|archive=1}}

{{WikiProject Telecommunicationsbanner shell|class=C}}|

{{WikiProject Telecommunications }}

}}

{{Expert-talk}}

For a person who has not studied information theory, the introduction chapter says absolutely nothing. It's some state of the art code, rrright. For what/Where/Why is it used? I think the introduction should answer these questions first. Then it's okay to jump into the technics. Besides, what's Forney's factor graph notation anyway? Maybe an article about it should be created, or at least [[Forney]] linked somewhere. (Elsewhere than to [[Forney, Texas]]). --[[User:ZeroOne|ZeroOne]] 19:52, 12 Oct 2004 (UTC)

Line 40 ⟶ 42:

I think H should be reduced to -P^T | I_{k} and not (n-k). Because the number of rows of H is actually k. It works for this example since n-k = k here, but for general n and k, it will not work. <!-- Template:Unsigned --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Swaprava|Swaprava]] ([[User talk:Swaprava#top|talk]] • [[Special:Contributions/Swaprava|contribs]]) 17:53, 5 January 2020 (UTC)</small> <!--Autosigned by SineBot-->

Similarly, G will be starting with I_{n-k} and not k. LDPC codes encode n-k bits into n bits, right? <!-- Template:Unsigned --><small class="autosigned">—&nbsp;Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[User:Swaprava|Swaprava]] ([[User talk:Swaprava#top|talk]] • [[Special:Contributions/Swaprava|contribs]]) 17:56, 5 January 2020 (UTC)</small> <!--Autosigned by SineBot-->

== Forgotten? ==