The Complexity of Information Set Decoding

IEEE Transactions on Information Theory

Volumn 36, Issue 5, 1990, Pages 1031-1037

  Coffey, John T ^a   Goodman, Rodney M ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING--DECODING;

BOUNDED HARD-DECISION DECODING; BOUNDED SOFT-DECISION DECODING; INFORMATION SET DECODING; LINEAR CODING; MINIMUM DISTANCE DECODING;

CODES, SYMBOLIC;

EID: 0025484012     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.57202     Document Type: Article

References (34)

1. E. R. Berlekamp, R. J. McEliece, and H. C. A. van Tilborg, “On the inherent intractability of certain coding problems,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 384–386, 1978.
2. L. A. Bassalygo, V. V. Zyablov, and M. S. Pinsker, “Problems of complexity in the theory of correcting codes,” Probl. Peredach. Inform., vol. 13, pp. 5–17, 1977.
3. L. B. Levitin and C. R. P. Hartmann, “A new approach to the general minimum distance decoding problem—The zero neighbors algorithm,” IEEE Trans. Inform. Theory, vol. IT-31, pp. 378–384, 1985.
4. C. R. P. Hartmann and L. B. Levitin, “An improvement of the zero-neighbors minimum distance decoding algorithm: The zero guards algorithm,” IEEE Int. Symp. Inform. Theory, Kobe, Japan, 1988.
5. E. Prange, “The use of information sets in decoding cyclic codes,” IRE Trans., vol. IT-8, pp. S5–S9, 1962.
6. F. J. MacWilliams, “Permutation decoding of systematic codes,” Bell Syst. Tech. J., vol. 43, pp. 485–505, 1964.
7. S. G. S. Shiva and K. C. Fung, “Permutation decoding of certain triple-error-correcting binary codes,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 444–446, 1972.
8. A. Benyamin-Seeyar, S. G. S. Shiva, and V. K. Bhargava, “Capability of error-trapping technique in decoding cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 166–180, 1986.
9. T. Kasami, “A decoding procedure for multiple-error-correcting cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-10, pp. 134–138, 1964.
10. O. F. Dmitriev, “An algorithm for the correction of independent errors by cyclic codes,” Probl. Peredach. Inform., vol. 3, pp. 102–104, 1967.
11. G. S. Evseev, “Complexity of decoding for linear codes,” Probl. Peredach. Inform., vol. 19, pp. 3–8, 1983.
12. L. D. Baumert, R. J. McEliece, and G. Solomon, “Decoding with multipliers,” Jet Propulsion Laboratory Deep Space Network Progress Report, 42–34, pp. 42–46.
13. G. C. Clark and J. B. Cain, Error-Correcting Coding for Digital Communications. New York: Plenum Press, 1981.
14. A. H. Chan and R. A. Games, “(n,k,t)-recovering systems and error-trapping decoding,” IEEE Trans. Inform. Theory, vol. IT-27, pp. 643–646, 1981.
15. P. G. Farrell, M. Rice, and F. Taleb, “Minimum weight decoding for cyclic codes,” in Proc. IMA Conf. on Cryptography and Coding, Cirencester, 1986.
16. R. M. F. Goodman and A. D. Green, “Microprocessor-controlled permutation decoding of error-correcting codes,” in Proc. IERE Conf. on Microprocessors in Automation and Commun., Kent, no. 41, 1978, pp. 365–376.
17. D. M. Mandelbaum, “On vote-taking and complete decoding of certain error-correcting codes,” Inform. Contr., vol. 43, pp. 195–197, 1979.
18. ——, “On complete decoding of linear error-correcting codes,” Inform. Contr., vol. 47, pp. 195–200, 1980.
19. V. K. Wei, “An error-trapping decoder for nonbinary cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 538–541, 1984.
20. J. P. Gao, L. D. Rudolph, and C. R. P. Hartmann, “Soft-decision decoding using a modified gradient method and multiple information sets,” IEEE Int. Symp. Inform. Theory, St. Jovite, Canada, 1983.
21. K. H. Farrell, L. D. Rudolph, C. R. P. Hartmann, and L. D. Nielsen, “Decoding by local optimization,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 740–743, 1983.
22. L. D. Rudolph, C. R. P. Hartmann, K. H. Farrell, J. P. Gao, and N. Tendolkar, “Further results on decoding by local optimization,” IEEE Int. Symp. Inform. Theory, Les Arcs, France, 1982.
23. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
24. T. J. Goblick, Jr., “Coding for a discrete information source with a distortion measure,” Ph.D. dissertation, Dept. of Elect. Eng., M.I.T., Cambridge, MA, 1962.
25. V. M. Blinovskii, “Lower asymptotic bound on the number of linear code words in a sphere of given radius in [FORMULA OMITTED],” Probl. Peredach. Inform., vol. 23, pp. 50–53, 1987.
26. L. B. Levitin, “Covering radius of almost all linear codes satisfies the Goblick bound,” recent results session, IEEE Int. Symp. Inform. Theory, Kobe, Japan, 1988.
27. J. T. Coffey and R. M. F. Goodman, “Any code of which we cannot think is good,” submitted to IEEE Trans. Inform. Theory.
28. G. J. Chaitin, “Information-theoretic computational complexity,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 10–15, 1974.
29. J. N. Pierce, “Limit distribution of the minimum distance of random linear codes,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 595–599, 1967.
30. D. Chase, “A class of algorithms for decoding block codes with channel measurement information,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 170–182, 1972.
31. J. K. Wolf, “Efficient maximum likelihood decoding of linear block codes using a trellis,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 76–80, 1978.
32. P. G. Farrell, M. Rice, and F. Taleb, “Division algorithms for hard-and soft-decision decoders,” in Proc. Int. Conf. Digital Signal Processing, Florence, Italy, 1987.
33. W. Godoy, Jr. and D. S. Arantes, “Suboptimum soft-decision decoding of block codes using the zero-neighbors algorithm,” IEEE Int. Symp. Inform. Theory, Kobe, Japan, 1988.
34. J. T. Coffey, R. M. F. Goodman, and P. G. Farrell, “Mapping vector decoding,” in Proc. Second Conf. Error-Correcting Codes, IBM Research Center, Almaden, CA, 1987.