No label defined (Q4542543)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1775410
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1775410

      Statements

      0 references
      0 references
      0 references
      0 references
      14 January 2004
      0 references
      decoding algorithm
      0 references
      regular codes
      0 references
      In 1963 Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these codes, and proves a good bound on the fraction of errors that can be corrected. As the codes that Gallager builds are derived from regular graphs, we refer to them as regular codes. Following the general approach introduced in \textit{M. Luby}, \textit{M. Mitzenmacher}, \textit{M. A. Shokrollahi}, \textit{D. A. Spielman} and \textit{V. Stemann} [Practical Loss-Resilient Codes, Proc. 29th Symp. on Theory of Computing, 150-159 (1997)] for the design and analysis of erasure codes, we consider error-correcting codes based on random irregular bipartite graphs, which we call irregular codes. We introduce tools based on linear programming for designing linear time irregular codes with better error-correcting capabilities than possible with regular codes. For example, the decoding algorithm for the rate \(1/2\) regular codes of Gallager can provably correct up to \(5.17\%\) errors asymptotically, whereas we have found irregular codes for which our decoding algorithm can provably correct up to \(6.27\%\) errors asymptotically. We include the results of simulations demonstrating the effectiveness of our codes on systems of reasonable size. For the entire collection see [Zbl 0988.00089].
      0 references

      Identifiers