Skip to main content
SpringerLink
Log in

On the inherent intractability of soft decision decoding of linear codes

  • Decoding In Real Space
  • Conference paper
  • First Online:
Coding Theory and Applications (Coding Theory 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 311))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.R. Berlekamp, R.J. McEliece and H.C.A. van Tilborg, "On the Inherent Intractability of Certain Coding Problems", IEEE, Trans. on IT, Vol. IT-24, No. 3, May, 1978.

    Google Scholar 

  2. S.C. Ntafos, S.L. Hakimi, "On the Complexity of Some Coding Problems", IEEE Trans. on IT, Vol. IT-27, No.6, November 1981.

    Google Scholar 

  3. A. Lobstein, G. Cohen, "Sur la Complexité d'un Problème de Codage", RAIRO on Theoretical Informatics and Applications, Vol. 21, No. 1, 1987. Gauthier-Villars, Paris.

    Google Scholar 

  4. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-completeness", San Francisco: Freeman, 1975.

    Google Scholar 

  5. G.D. Jr. Forney, "Concatenated Codes", MIT press. Cambridge, May, 1966.

    Google Scholar 

  6. G. Battail, "Décodage Pondéré Optimal des Codes Linéaires en Blocs I-Emploi Simplifié du Diagramme du Treillis", Annales des Télécommunications, 38, 11–12, pp.443–459.

    Google Scholar 

  7. R. M. Fano, "A Heuristic Discussion of Probabilistic Decoding", IEEE, Trans. IT-9. pp.66–74, Apr. 1963.

    Google Scholar 

  8. A.J. Viterbi, J.K. Omura, "Principles of Digital Communication and Coding", McGraw-Hill, 1971.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département Systèmes et Communications, CNRS UA 820, Ecole Nationale Supérieure des Télécommunications, 46, Rue Barrault, 75634, Paris, Cédex 13, France

    J. Fang, G. Cohen, P. Godlewski & G. Battail

Authors
  1. J. Fang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Godlewski
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. G. Battail
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

G. Cohen P. Godlewski

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fang, J., Cohen, G., Godlewski, P., Battail, G. (1988). On the inherent intractability of soft decision decoding of linear codes. In: Cohen, G., Godlewski, P. (eds) Coding Theory and Applications. Coding Theory 1986. Lecture Notes in Computer Science, vol 311. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19368-5_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-19368-5_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19368-5

  • Online ISBN: 978-3-540-39243-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation