Constructing optimal ternary constant-weight codes by placing pieces on chessboards

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 66-

  Svanstrom, M ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CODE-WORDS; CONSTANT-WEIGHT CODES; HAMMING WEIGHTS; MINIMAL LENGTHS; MINIMUM DISTANCE;

INFORMATION THEORY;

OPTIMIZATION;

EID: 26744472375     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.708649     Document Type: Conference Paper

References (3)

1. A. E. Brouwer, J. B. Shearer, N. J. A. Sloane, and W. D. Smith, "A new table of constant weight codes," IEEE Transactions on Information Theory, vol. IT-36, no. 6, pp. 1334-1380, Nov 1990.
2. T. Ericson and V. Zinoviev, "Spherical codes generated by binary partitions of symmetric pointsets," IEEE Transactions on Information Theory, vol. 41, no. 1, pp. 107-129, Jan 1995.
3. M. Svanstrom, Ternary Codes with Constant Weight, Licentiate thesis, Linkoping University, Sep 1997, Thesis No. 646.