[BARG] A. Barg. ``Complexity Issues in Coding Theory'' in Handbook of Coding Theory, Vol 1 (edited by V. Pless, W. Huffman, R. Brualdi). North-Holland. (1998). Available at citeseer

[BMT] E. R. Berlekamp, R. J. McEliece, and H. C. A. Van Tilborg. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory. 24 (1978) 384-386.

[CHA] F. Chabaud. On the security of some cryptosystems based on error-correcting codes. Laboratoire d'Information de l'ENS, Preprint 1994. Available at citeseer

[GUA] GUAVA, GUAVA web site

[HILL] R. Hill A First Course In Coding Theory, Oxford University Press. (1986).

[LEO] J. S. Leon. A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inform. Theory. 34 (1988) 1354-1359.

[MS] F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. North-Holland. (1983).

[VAR] A. Vardy, Algorithmic complexity in coding theory and the minimum distance problem, Annual ACM Symposium on Theory of Computing, Proceedings of the twenty-ninth annual ACM symposium on Theory, El Paso, Texas, pages: 92 - 109, 1997. Available at ACM Portal

David Joyner 2004-04-27