A lower bound for ternary constant weight codes

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1630-1632

  Svanström, Mattias ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Constant weight codes; Ternary codes

Indexed keywords

CODES (SYMBOLS); MATRIX ALGEBRA; THEOREM PROVING; VECTORS;

CODEWORD; GILBERT BOUND; HAMMING DISTANCE; LOWER BOUND; TERNARY CONSTANT WEIGHT CODES;

BINARY CODES;

EID: 0031234377     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623164     Document Type: Article

References (5)

1. 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, vol. 36, pp. 1334-1380, Nov. 1990.
2. R. L. Graham and N. J. A. Sloane, "Lower bounds for constant weight codes," IEEE Trans. Inform. Theory, vol. IT-26, pp. 37-43, Jan. 1980.
3. T. Kløve, "A lower bound for A(n, 4, w)," IEEE Trans. Inform. Theory, vol. IT-27, pp. 257-258, Mar. 1981.
4. E. N. Gilbert, "A comparison of signalling alphabets," Bell Syst. Tech. J., vol. 31, pp. 504-522, May 1952.
5. S. M. Johnson, "A new upper bound for error-correcting codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 203-207, Apr. 1962.