New binary covering codes obtained by simulated annealing

IEEE Transactions on Information Theory

Volumn 42, Issue 1, 1996, Pages 300-302

  Wille, L T ^a,b  

^a IEEE

^b FLORIDA ATLANTIC UNIVERSITY   (United States)

Author keywords

Binary codes; Covering radius; Coverings; Simulated annealing

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; INFORMATION THEORY; ITERATIVE METHODS; SIMULATED ANNEALING; TABLE LOOKUP;

BINARY COVERING CODES; CODEWORDS; COVERING RADIOS; LOGARITHMIC COOLING; UPPER AND LOWER BOUNDS;

BINARY CODES;

EID: 0029734859     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.481808     Document Type: Article

References (19)

1. G. I. M. van Wee, "Some new lower bounds for binary and ternary covering codes," IEEE Trans. Inform. Theory, vol. 39, pp. 1422-1424, July 1993.
2. Z. Zhang and C. Lo, "Linear inequalities for covering codes: Part II - Triple covering inequalities," IEEE Trans. Inform. Theory, vol. 38, pp. 1648-1662. Nov. 1992.
3. L. T. Wille, "Improved binary code coverings by simulated annealing," Congressus Numerantium, vol. 73, pp. 53-58, Jan. 1990.
4. P. R. J. Östergård and H. O. Hämäläinen, "New upper bounds for binary/ternary mixed covering codes," Helsinki University of Technology, Sci. A: Res. Rep. 22, Mar. 1993.
5. H. Hämäläinen and S. Rankinen, "Upper bounds for football pool problems and mixed covering codes," J. Comb. Theory A, vol. 56, pp. 84-95, 1991.
6. P. R. J. Östergård, "A new binary code of length 10 and covering radius 1," IEEE Trans. Inform. Theory, vol. 37, pp. 179-180, Jan. 1991.
7. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
8. A. A. El Gamal, L. A. Hemachandra, I. Shperling, and V. K. Wei, "Using simulated annealing to design good codes," IEEE Trans. Inform. Theory, vol. IT-33, pp. 116-123. Jan. 1987.
9. L. T. Wille, "The football pool problem for 6 matches: A new upper bound obtained by simulated annealing," J. Comb. Theory A, vol. 45, pp. 171-177, 1987.
10. P. J. M. van Laarhoven, E. H. L. Aarts, J. H. van Lint, and L. T. Wille, "New upper bounds fur the football pool problem for 6, 7, and 8 matches," J. Comb. Theory A, vol. 52, pp. 304-312, 1989.
11. P. R. J. Östergård, "Further results on (k, t)-subnormal covering codes," IEEE Trans. Inform. Theory, vol. 38, pp. 206-210, Jan. 1992.
12. _, "New upper bounds for the football pool problem for 11 and 12 matches," J. Comb. Theory A, vol. 67, pp. 161-168, 1994.
13. P. J. M. van Laarhoven and E. H. L. Aarts, Simulated Annealing: Theory and Applications. Dordrecht, The Netherlands: Kluwer, 1988.
14. C. R. Reeves, Ed., Modern Heuristic Techiques for Combinatorial Problems. Oxford, UK: Backwell Sci. Pub., 1993.
15. A. Blokhuis and C. W. H. Lam, "More coverings by rook domains," J. Comb. Theory A, vol. 36, pp. 240-244, 1984.
16. K. U. Koschnick, "A new upper bound for the football pool problem for nine matches," J. Comb. Theory A, vol. 62. pp. 162-167, 1993.
17. G. D. Cohen, A. C. Lobstein, and N. J. A. Sloane, "Further results on the covering radius of codes," IEEE Trans. Inform. Theory, vol. IT-32, pp. 680-694, Sept. 1986.
18. G. J. M. van Wee, "Improved sphere bounds on the covering radius of codes," IEEE Trans. Inform. Theory, vol. 34, pp. 237-245, Mar/1988.
19. Z. Zhang, "Linear inequalities for covering codes: Part I - Pair covering inequalities," IEEE Trans. Inform. Theory, vol. 37, pp. 573-582, May 1991.