An updated table of binary/ternary mixed covering codes

Journal of Combinatorial Designs

Volumn 12, Issue 3, 2004, Pages 157-176

  Bertolo, Riccardo ^a   Östergard, Patric R J ^b   Weakley, William D ^c  

^a not available   (Italy)

^b AALTO UNIVERSITY   (Finland)

^c INDIANA UNIVERSITY PURDUE UNIVERSITY FORT WAYNE   (United States)

Author keywords

Bounds on codes; Covering radius; Football pool problem; Mixed code

Indexed keywords

COMBINATORIAL MATHEMATICS;

BOUNDS ON CODES; CARDINALITIES; COVERING CODES; COVERING RADIUS; FOOTBALL POOL PROBLEM; LOWER BOUNDS; MIXED CODE; NEW CONSTRUCTIONS;

CODES (SYMBOLS);

EID: 2342595921     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.20008     Document Type: Article

References (26)

1. U. Blass and S. Litsyn, Several new lower bounds on the size of codes with covering radius one, IEEE Trans Inform Theory 44 (1998), 1998-2002. (Pubitemid 128738573)
2. J. C. Cock and P. R. J. Östergard, Ternary covering codes derived from BCH codes, J Combin Theory Ser A 80 (1997), 283-289. (Pubitemid 127340244)
3. G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering codes, North-Holland, Amsterdam, 1997.
4. F. Di Pasquale and P. R. J. Östergard, An improved upper bound for the football pool problem for nine matches, J Combin Theory Ser A 102 (2003), 204-206. (Pubitemid 36549959)
5. W. Haas, Lower bounds for q-ary codes of covering radius one, Discrete Math 219 (2000), 97-106.
6. L. Habsieger and A. Plagne, New lower bounds for covering codes, Discrete Math 222 (2000), 125-149.
7. H. Hämäläinen, I. Honkala, S. Litsyn, and P. Östergärd, Football pools-A game for mathematicians, Amer Math Monthly 102 (1995), 579-588.
8. H. Hämäläinen and S. Rankinen, Upper bounds for football pool problems and mixed covering codes, J Combin Theory Ser A 56 (1991), 84-95.
9. S. M. Johnson, A new lower bound for coverings by rook domains, Utilitas Math 1 (1972), 121-140.
10. J. G. Kalbfleisch and P. H. Weiland, Some new results for the covering problem, In: W. T. Tutte (Editor), Recent progress in combinatorics (Proc. third Waterloo conf. on combinatorics, 1968), Academic Press, New York, 1969, pp. 37-45.
11. G. Kéri and P. R. J. Östergard, On the covering radius of small codes, Studia Sci Math Hungar 40 (2003), 243-256. (Pubitemid 43108658)
12. J. H. van Lint, Jr. and G. J. M. van Wee, Generalized bounds on binary/ternary mixed packing and covering codes, J Combin Theory Ser A 57 (1991), 130-143.
13. K. L. Ma, In solving the dominating set problem: Group theory approach, Ph.D. thesis, Concordia University, Montréal, 1998.
14. B. D. McKay, nauty user's guide (version 1.5), Computer Science Department, Australian National University, Tech Rep TR-CS-90-02, 1990.
15. P. R. J. Östergard, A new binary code of length 10 and covering radius 1, IEEE Trans Inform Theory 37 (1991), 179-180.
16. P. R. J. Östergard, Further results on (k; t)-subnormal covering codes, IEEE Trans Inform Theory 38 (1992), 206-210.
17. P. R. J. Östergard, The football pool problem, Congr Numer 114 (1996), 33-43.
18. P. R. J. Östergard, Classification of binary/ternary one-error-correcting codes, Discrete Math 223 (2000), 253-262.
19. P. R. J. Östergard and U. Blass, On the size of optimal binary codes of length 9 and covering radius 1, IEEE Trans Inform Theory 47 (2001), 2556-2557. (Pubitemid 32949905)
20. P. R. J. Östergard and H. O. Hämäläinen, A new table of binary/ternary mixed covering codes, Des Codes Cryptogr 11 (1997), 151-178. (Pubitemid 127502288)
21. P. R. J. Östergard and A. Wassermann, A new lower bound for the football pool problem for six matches, J Combin Theory Ser A 99 (2002), 175-179.
22. P. R. J. Östergard and W. D. Weakley, Constructing covering codes with given automorphisms, Des Codes Cryptogr 16 (1999), 65-73. (Pubitemid 129617274)
23. P. R. J. Östergard and W. D. Weakley, Classification of binary covering codes, J Combin Des 8 (2000), 391-401.
24. P. R. J. Östergard and W. D. Weakley, Classifying optimal ternary codes of length 5 and covering radius 1, Beiträge Algebra Geom 43 (2002), 445-449.
25. G. J. M. van Wee, Bounds on packings and coverings by spheres in q-ary and mixed Hamming spaces, J Combin Theory Ser A 57 (1991), 117-129.
26. L. T. Wille, Improved binary code coverings by simulated annealing, Congr Numer 73 (1990), 53-58.