Decoding algorithm of low-density parity-check codes based on Bowman-Levin approximation (Q2655582): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00354-008-0069-1 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00354-008-0069-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2077659015 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S00354-008-0069-1 / rank
 
Normal rank

Latest revision as of 13:22, 19 December 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
    0 references
    0 references
    0 references
    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

    Identifiers