Advertisement

On the inherent intractability of soft decision decoding of linear codes

  • J. Fang
  • G. Cohen
  • P. Godlewski
  • G. Battail
Decoding In Real Space
Part of the Lecture Notes in Computer Science book series (LNCS, volume 311)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. /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. /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. /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. /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. /5/.
    G.D. Jr. Forney, "Concatenated Codes", MIT press. Cambridge, May, 1966.Google Scholar
  6. /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. /7/.
    R. M. Fano, "A Heuristic Discussion of Probabilistic Decoding", IEEE, Trans. IT-9. pp.66–74, Apr. 1963.Google Scholar
  8. /8/.
    A.J. Viterbi, J.K. Omura, "Principles of Digital Communication and Coding", McGraw-Hill, 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • J. Fang
    • 1
  • G. Cohen
    • 1
  • P. Godlewski
    • 1
  • G. Battail
    • 1
  1. 1.Département Systèmes et Communications, CNRS UA 820Ecole Nationale Supérieure des TélécommunicationsParis, Cédex 13France

Personalised recommendations