Serdica Mathematical Journal, Vol. 26, No 1, (2000), 5p-12p
Abstract:
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.
Description:
This work was partially supported by the Bulgarian National Science Fund under Grant I–618/96.
