Any Code of Which We Cannot Think Is Good

IEEE Transactions on Information Theory

Volumn 36, Issue 6, 1990, Pages 1453-1461

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

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY--RANDOM PROCESSES;

CODING THEORY; KOLMOGOROV COMPLEXITY; LINEAR CODES; NONLINEAR CODES;

CODES, SYMBOLIC;

EID: 0025521997     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.59944     Document Type: Article

References (30)

1. E. N. Gilbert, “A comparison of signalling alphabets,” Bell Syst. Tech. J., vol. 31, 504–522, 1952.
2. R. R. Varshamov, “Estimate of the number of signals in error correcting codes,” Dokl. Akad. Nauk. SSSR, vol. 117, pp. 739–741, 1957.
3. J. M. Wozencraft and B. Reiffen, sequential Decoding. Cambridge, MA: MIT Press, 1961.
4. M. Davis, Ed., The Undecidable. Hewlett, N.Y.: Raven Press, 1965.
5. M. Davis, Computability and Unsoleability. New York: McGraw-Hill, 1958.
6. A. N. Kolmogorov, “Three approaches to the definition of the concept quantity of information,'” Probl. Peredach. Inform., vol. 1, pp. 3–11, 1965.
7. G. J. Chaitin, “On the length of programs for computing finite binary sequences,” J. ACM, vol. 13, pp. 547–569, 1966.
8. A. N. Kolmogorov, “Logical basis for information theory and probability theory,” IEEE Trans. Inform. Theory, vol. IT-14, pp. 662–664, 1968.
9. G. J. Chaitin, “On the difficulty of computations,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 5–9, 1970.
10. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
11. H. J. Helgert, “Alternant codes,” Inform. Contr., vol. 26, pp. 369–380, 1974.
12. R. T. Chien and D. M. Choy, “Algebraic generalization of BCH-Goppa-Helgert codes,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 70–79, 1975.
13. V. D. Goppa, “A new class of linear error-correcting codes,” Probl. Peredach. Inform., vol. 6, pp. 207–212, 1970.
14. T. Kasami, “A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2,” IEEE Trans. Inform. Theory, vol. IT-20, 679, 1974.
15. T. Kasami, “An upper bound on k/n for affine invariant codes with fixed d/n,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 174–176, 1969.
16. F. J. MacWilliams, N. J. A. Sloane, and J. G. Thompson, “Good self-dual codes exist,” Discrete Math., vol. 3, pp. 153–162, 1972.
17. V. M. Blinovskii, “Lower asymptotic bound on the number of linear code words in a sphere of given radius in F” Probl. Peredach. Inform., vol. 23, pp. 50–53, 1987.
18. R. J. McEliece, E. R. Rodemich, H. C. Rumsey, Jr., and L. R. Welch, “New upper bounds oh the rate of a code via the Delsarte-MacWilliams inequalities,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 157–166, 1977.
19. M. A. Tsfasman, S. G. VlĂduŢ, and T. Zink, “Modular curves, Shimura curves, and Goppa codes better than the Varshamov-Gilbert bound,” Mathematische Nachrichten, vol. 104, pp. 13–28, 1982.
20. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
21. R. J. McEliece, The Theory of Information and Coding. Reading, MA: Addison-Wesley, 1977.
22. L. A. Bassalygo, “Formalization of the problem of the complexity of code specification,” Probl. Peredach. Inform., vol. 12, pp. 105–106, 1976.
23. L. A. Bassalygo, V. V. Zyablov, and M. S. Pinsker, “Problems of complexity in the theory of correcting codes,” Probl. Peredach. Inform., vol. 13, 5–17, 1977.
24. V. Yu. Krachkovskii, “Complexity of constructing codes with specified correction properties,” Probl. Peredach. Inform., vol. 15, pp. 50–55, 1979.
25. V. V. Zyablov, “An estimate of the complexity of constructing binary linear cascade codes,” Probl. Peredach. Inform., vol. 7, pp. 5–13, 1971.
26. J. T. Coffey and R. M. F. Goodman, “The complexity of information set decoding,” IEEE Trans. Inform. Theory, vol. 36, no. 5, pp. 1990.
27. P. Martin-Lof, “The definition of random sequences,” Inform. Contr., vol. 9, 602–619, 1966.
28. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 1. New York: Wiley, 1965.
29. P. Piret, “On the number of divisors of a polynomial over GF(2),” Second Int. Conf. Appl. Algebra, Algorithmics and Error-Correcting Oct. 1984.
30. P. Delsarte, “On subfield subcodes of modified Reed-Solomon codes,” IEEE Trans. Inform. Theory, vol. IT-21, pp. 575–576, 1975.