Bounds on mixed binary/ternary codes

IEEE Transactions on Information Theory

Volumn 44, Issue 1, 1998, Pages 140-161

  Brouwer, A E ^a   Hämäläinen, Heikki O ^a   Östergard, Patrie R J ^a   Sloane, N J A ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION; LINEAR PROGRAMMING;

CLIQUE FINDING; MIXED CODES; TABU SEARCH; TERNARY CODES;

BINARY CODES;

EID: 0031647356     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.651001     Document Type: Article

References (44)

1. D. Applegate and D. S. Johnson, personal communication, 1993 [OnlineJ. Available from ftp://dimacs.rutgers.edu/pu /chailenge/graph/solvers.
2. M.R. Best, "Binary codes with a minimum distance of four," IEE Trans. Inform. Theory, vol. IT-26, pp. 738-742, 1980.
3. M.R. Best and A. E. Brouwer, "The triply shortened binary Hammin code is optimal," Discr. Math., vol. 17, pp. 235-245, 1977.
4. M.R. Best, A. E. Brouwer, F. J. MacWilliams, A. M. Odlyzko, and N J. A. Sloane, "Bounds for binary codes of length less than 25," IEE Trans. Inform. Theory, vol. IT-24, pp. 81-93, 1978.
5. S. Bitan and T. Etzion, "Constructions for optimal constant weigh cyclically permutable codes and difference families," IEEE Trans Inform. Theory, vol. 41, pp. 77-87, 1995.
6. A. Blokhuis and C. W. H. Lam, "More coverings by rook domains," J Combin. Theory Ser. A, vol. 36, pp. 240-244, 1984.
7. A.E. Brouwer, A. M. Cohen, and A. Neumaier, Distance-Regula Graphs, Ergebnisse der Mathematik 3.18. Heidelberg, Germany Springer-Verlag, 1989.
8. A.E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, " new table of constant weight codes," IEEE Trans. Inform. Theory, vol 36, pp. 1334-1380, 1990.
9. J.H. Conway and N. J. A. Sloane, Sphere Packings, Lattices an Groups, 2nd ed., Grundlehren der math. Wissenschaften 290. Ne York: Springer-Verlag, 1993.
10. R. Davies and G. F. Royle, "Graph domination, tabu search and th football pool problem," Discr. Appl. Math., vol. 10, pp. 217-228, 1997.
11. A. Dey, Theory of Block Designs. New Delhi, India: Wiley, 1986.
12. T. Etzion and G. Greenberg, "Constructions of mixed perfect code and other covering codes," IEEE Trans. Inform. Theory, vol. 39, pp 209-214, 1993.
13. T.A. Feo, M. G. C. Resende, and S. H. Smith, "A greedy randomize adaptive search procedure for maximum independent set," Oper. Res. vol. 42, pp. 860-878, 1994.
14. F. Glover, "Tabu search-Part I," ORSA J. Comput., vol. 1, pp. 190-206 1989.
15. C.D. Godsil, Algebraic Combinatorics. New York: Chapman & Hall 1993.
16. H. Hämäläinen, I. Honkala, S. Litsyn, and P. Östergard, "Footbal pools-A game for mathematicians," Amer. Math. Monthly, vol. 102 pp. 579-588, 1995.
17. H. Hämäläinen and S. Rankinen, "Upper bounds for football poo problems and mixed covering codes," J. Combin. Theory Ser. A, vol 56, pp. 84-95, 1991.
18. P.W. Heijnen, "There exists no binary
19. -code" (in Dutch) Master's thesis, Delft Univ. of Technol., Delft, The Netherlands, 1993.
20. D.B. Jaffe, "Binary linear codes: New results on nonexistence," Tech Rep., Dept. Math. Statist., Univ. of Nebraska, Lincoln, Oct. 1996
21. D. Julin, "Two improved block codes," IEEE Trans. Inform. Theory vol. IT-11, p. 459, 1965.
22. H.J. L. Kamps and J. H. van Lint, "A covering problem," Colloq. Math Soc. Jânos Bolyai, vol. 4, pp. 679-685, 1970.
23. Y. Klein, S. Litsyn, and A. Vardy, "Two new bounds on the size o binary codes with a minimum distance of three," Des. Codes Cryptogr. vol. 6, pp. 219-227, 1995.
24. F.R. Kschischang and S. Pasupathy, "Some ternary and quaternar codes and associated sphere packings," IEEE Trans. Inform. Theory vol. 38, pp. 227-246, 1992.
25. J.H. van Lint, Jr., and G. J. M. van Wee, "Generalized bounds o binary/ternary mixed packing and covering codes," J. Combin. Theor Ser. A, vol. 57, pp. 130-143, 1991.
26. S. Litsyn and A. Vardy, "The uniqueness of the Best code," IEEE Trans Inform. Theory, vol. 40, pp. 1693-1698, 1994.
27. P. Lizak, "Minimum distance bounds for linear codes over GF (3) an GF(4)," Master's thesis, Math, and Comput. Sci. Dept., Univ. Salford July 1992.
28. Lohinen (pseudonym of Olof Laxen), in the Finnish weekly Veikkaus Lotto, nos. 41 (JV(0, 6, 3) > 37) and 49 (.N(0, 7, 3) > 99) 1981.
29. C. Mackenzie and J. Seberry, "Maximal ternary codes and Plotkin' bound," Ars Combin., vol. 17A, pp. 251-270, 1984.
30. F.J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correctin Codes. Amsterdam, The Netherlands: North-Holland, 1977.
31. W.J. Martin, "Designs in product association schemes," May 1996 preprint.
32. P.R. J. Östergard, "New upper bounds for the football pool problem fo 11 and 12 matches," J. Combin. Theory Ser. A, vol. 67, pp. 161-168 1994.
33. -, "Constructing covering codes by tabu search," J. Combin. Des. vol. 5, pp. 71-80, 1997.
34. P.R. J. Östergard and H. O. Hämäläinen, "A new table of binary/ternar mixed covering codes," Des. Codes Cryptogr., vol. 11, pp. 151-178 1997.
35. P.R. J. Östergärd and M. K. Kaikkonen, "New singleor-correctin codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1261-1262, 1996.
36. A. Perttula, personal communication, 1995.
37. J. Simonis, "MacWilliams identities and coordinate partitions," Lin. Alg Appl., vol. 216, pp. 81-91, 1995.
38. N.J. A. Sloane and J. Stufken, "A linear programming bound fo orthogonal arrays with mixed levels," J. Statist. Plann. Inference, vol 56, pp. 295-306, 1996.
39. M. Svanström, "A ternary code from orthogonal vectors over th complex numbers," in Proc. 5th Int. Workshop on Algebraic and Combinatorial Coding Theory (Sozopol, Bulgaria, June 1-7, 1996). Shumen Bulgaria: Unicorn, 1996, pp. 266-269
40. M. Szegedy, "CKit: A toolkit for generating C programs," in preparation.
41. G. Taguchi, System of Experimental Design. White Plains, NY UNIPUB/Krause, 1987.
42. Thor (pseudonym), in Tippernes Systembok 16. Oslo, Norway: Tippe bladet Tips, 1992.
43. R.J. M. Vaessens, E. H. L. Aarts, and J. H. van Lint, "Genetic algorithm in coding theory-A table for As(n, d)," Discr. Appl. Math., vol. 45 pp. 71-87, 1993.
44. G.J. M. van Wee, "Bounds on packings and coverings by spheres i g-ary and mixed Hamming spaces," J. Combin. Theory Ser. A, vol. 57 pp. 117-129, 1991.