Mathematical analysis of an iterative decoding algorithm for low-density codes (Q5930867)

From MaRDI portal
Revision as of 23:40, 4 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1592153
Language Label Description Also known as
English
Mathematical analysis of an iterative decoding algorithm for low-density codes
scientific article; zbMATH DE number 1592153

    Statements

    title
    Mathematical analysis of an iterative decoding algorithm for low-density codes (English)
    0 references
    author
    K. Sh. Zigangirov
    0 references
    M. Lentmaier
    0 references
    publication date
    26 April 2001
    0 references
    review text
    A two-phase iterative algorithm for decoding of low-density codes is proposed and analyzed. It is proved that the decoding error probability approaches zero when the code length grows to infinity.
    0 references
    zbMATH Keywords
    iterative algorithm
    0 references
    decoding
    0 references
    low-density codes
    0 references

    Identifiers

    zbMATH DE Number
    1592153
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5930867&oldid=25453907"
    Powered by MediaWiki