1. McEliece, R.J.: The Theory of Information and Coding. Number 86. Cambridge University Press (2004)
2. Karp, R.M.: Reducibility among combinatorial problems. In Miller, R.E., Thatcher, J.W., eds.: Proceedings of a symposium on the Complexity of Computer Computations, held March 20–22, 1972, pp. 85–103. The IBM Research Symposia Series, Plenum Press, New York (1972)
3. Dontas, K., Jong, K.A.D.: Discovery of maximal distance codes using genetic algorithms. In: Proceedings of IEEE TAI 1990, pp. 805–811. IEEE Computer Society (1990)
4. McGuire, K.M., Sabin, R.E.: Using a genetic algorithm to find good linear error-correcting codes. In George, K.M., Lamont, G.B., eds. Proceedings of the 1998 ACM symposium on Applied Computing, SAC 1998, Atlanta, GA, USA, February 27 - March 1, 1998, pp. 332–337. ACM (1998)
5. Chen, H., Flann, N.S., Watson, D.W.: Parallel genetic simulated annealing: a massively parallel SIMD algorithm. IEEE Trans. Parallel Distrib. Syst. 9(2), 126–136 (1998)