Ternary constant weight codes

Electronic Journal of Combinatorics

Volumn 9, Issue 1 R, 2002, Pages 1-23

  Östergård, Patric R J ^a   Svanström, Mattias ^b  

^a AALTO UNIVERSITY   (Finland)

^b LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Bounds on codes; Constant weight code; Error correcting code; Ternary code

Indexed keywords

EID: 3042637673     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1657     Document Type: Article

References (29)

1. E. Agrell, A. Vardy, and K. Zeger, Upper bounds for constant-weight codes, IEEE Trans. Inform. Theory 46 (2000), 2373-2395.
2. E. Agrell, A. Vardy, and K. Zeger, A table of upper bounds for binary codes, IEEE Trans. Inform. Theory 47 (2001), 3004-3006.
3. S. Blake-Wilson and K. T. Phelps, Constant weight codes and group divisible designs, Des. Codes Cryptogr. 16 (1999), 11-27.
4. G. T. Bogdanova, Some ternary lexicographic codes, in: Proc. II International Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, 1998, pp. 9-14.
5. G. T. Bogdanova, A. E. Brouwer, S. N. Kapralov, and P. R. J. Östergård, Error-correcting codes over an alphabet of four elements, Des. Codes Cryptogr. 23 (2001), 333-342.
6. A. E. Brouwer, H. O. Hämäläinen, P. R. J. Östergård, and N. J. A. Sloane, Bounds on mixed binary/ternary codes, IEEE Trans. Inform. Theory 44 (1998), 140-161.
7. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, A new table of constant weight codes, IEEE Trans. Inform. Theory 36 (1990), 1334-1380.
8. K. Chen, G. Ge, and L. Zhu, Generalized Steiner triple systems with group size five, J. Combin. Des. 7 (1999), 441-452.
9. J. H. Conway, A. Hulpke, and J. McKay, On transitive permutation groups, LMS J. Comput. Math 1 (1998), 1-8.
10. k and generalized designs, Discrete Math. 169 (1997), 55-82.
11. F.-W. Fu, T. Kløve, Y. Luo, and V. K. Wei, On the Svanström bound for ternary constant weight codes, IEEE Trans. Inform. Theory 47 (2001), 2061-2064.
12. F.-W. Fu, A. J. H. Vinck, and S.-Y. Shen, On the constructions of constant-weight codes, IEEE Trans. Inform. Theory 44 (1998), 328-333.
13. I. S. Honkala and P. R. J. Östergård, Code design, in: E. Aarts and J. K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997, pp. 441-456.
14. S. M. Johnson, A new upper bound for error-correcting codes, IRE Trans. Inform. Theory 8 (1962), 203-207.
15. K. S. Kapralov, The nonexistence of ternary (10,15,7) codes, in: Proc. Seventh International Workshop on Algebraic and Combinatorial Coding Theory (ACCT'2000), Bansko, Bulgaria, 18-24 June, 2000, pp. 189-192.
16. J. van Lint and L. Tolhuizen, On perfect ternary constant weight codes, Des. Codes Cryptogr. 18 (1999), 231-234.
17. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
18. B. D. McKay, nauty user's guide (version 1.5), Computer Science Department, Australian National University, Tech. Rep. TR-CS-90-02, 1990.
19. S. Niskanen and P. R. J. Östergård, Cliquer user's guide, version 1.0, in preparation.
20. P. R. J. Östergård, On binary/ternary error-correcting codes with minimum distance 4, in: M. Fossorier, H. Imai, S. Lin, and A. Poli (Eds.), Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, LNCS 1719, Springer, Berlin, 1999, pp. 472-481.
21. P. R. J. Östergård, A new algorithm for the maximum-weight clique problem, Nordic J. Comput. 8 (2001), 424-436.
22. M. Svanström, A lower bound for ternary constant weight codes, IEEE Trans. Inform. Theory 43 (1997), 1630-1632.
23. M. Svanström, A class of perfect ternary constant-weight codes, Des. Codes Cryptogr. 18 (1999), 223-229.
24. M. Svanström, Ternary codes with weight constraints, Ph.D. thesis, Linköpings universitet, Dissertation No. 572, 1999.
25. M. Svanström, P. R. J. Östergård, and G. T. Bogdanova, Bounds and constructions for ternary constant-composition codes, IEEE Trans. Inform. Theory 48 (2002), 101-111.
26. H. Tarnanen, An approach to constant weight and Lee codes by using the methods of association schemes, Ann. Univ. Turku. Ser. A I, No. 182, University of Turku, 1982.
27. 3(n, d), Discrete Appl. Math. 45 (1993), 71-87.
28. W. D. Wallis, One-Factorizations, Kluwer, Dordrecht, 1997.
29. J. Yin, Y. Lu, and J. Wang, Maximum distance holey packings and related codes, Sci. China Ser. A, 42 (1999), 1262-1269.