NEW BOUNDS FOR THE MAXIMUM SIZE OF TERNARY CONSTANT WEIGHT CODES

Optimal ternary constant-weight lexicogarphic codes have been constructed. New bounds for the maximum size of ternary constant-weight codes are obtained. Tables of bounds on A3(n,d,w) are given for d = 3,4,6.

[1]  Irène Charon,et al.  The noising method: a new method for combinatorial optimization , 1993, Oper. Res. Lett..

[2]  Selmer M. Johnson.  A new upper bound for error-correcting codes , 1962, IRE Trans. Inf. Theory.

[3]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[4]  N. J. A. Sloane,et al.  Lexicographic codes: Error-correcting codes from game theory , 1986, IEEE Trans. Inf. Theory.

[5]  R. Brualdi,et al.  Greedy Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.

[6]  M. Svanstrom.  A lower bound for ternary constant weight codes , 1997 .