Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation (Q2655582): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3795289 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5538637 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Good error-correcting codes based on very sparse matrices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequential Minimization of the Bethe Free Energy of Ising Spin Systems / rank | |||
Normal rank | |||
Revision as of 09:32, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation |
scientific article |
Statements
Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation (English)
0 references
25 January 2010
0 references
Bethe free energy
0 references
error correcting code
0 references
low-density parity-check codes
0 references
Bowman-Levin approximation
0 references
belief propagation
0 references
0 references
