STACS 2000

In this paper, I will give a brief introduction to the theory of low-density parity-check codes, and their decoding. I will emphasize the case of correcting erasures as it is still the best understood and most accessible case. At the end of the paper, I will also describe more recent developments.

[1]  David Peleg,et al.  An optimal synchronizer for the hypercube , 1987, PODC '87.

[2]  Guy Kortsarz.  On the Hardness of Approximating Spanners , 2001, Algorithmica.

[3]  Rajeev Raman,et al.  Priority Queues: Small, Monotone and Trans-dichotomous , 1996, ESA.

[4]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[5]  Edith Hemaspaandra.  The Complexity of Poor Man's Logic , 2001, J. Log. Comput..

[6]  C. Levcopoulos,et al.  There are planar graphs almost as good as the complete graphs and as short as minimum spanning trees (invited) , 1989 .

[7]  Werner Nutt,et al.  The Complexity of Concept Languages , 1997, KR.

[8]  Mikkel Thorup,et al.  Faster deterministic sorting and priority queues in linear space , 1998, SODA '98.

[9]  Guy Kortsarz,et al.  Generating Sparse 2-Spanners , 1994, J. Algorithms.

[10]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[11]  Werner Nutt,et al.  The Complexity of Existential Quantification in Concept Languages , 1992, Artif. Intell..

[12]  Uwe Schöning.  Complexity Cores and Hard-To-Prove Formulas , 1987, CSL.

[13]  Philippe Schnoebelen,et al.  The Complexity of Propositional Linear Temporal Logics in Simple Cases (Extended Abstract) , 1998, STACS.

[14]  Joseph Y. Halpern.  The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[15]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[16]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..