On the inherent intractability of soft decision decoding of linear codes

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

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

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

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

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

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

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

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