On the SvanstrÖm bound for ternary constant-weight codes

IEEE Transactions on Information Theory

Volumn 47, Issue 5, 2001, Pages 2061-2064

  Fu, Fang Wei ^a   KlØve, Torleiv ^a,b   Luo, Yuan ^a,c   Wei, Victor K ^a,d  

^a NANKAI UNIVERSITY   (China)

^b UNIVERSITY OF BERGEN   (Norway)

^c INSTITUTE OF SYSTEMS SCIENCE   (China)

^d CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Constant weight codes (CWCs); Skolem sequences; Svanstr m bound; Ternary codes

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL METHODS; SET THEORY; THEOREM PROVING;

TERNARY CONSTANT WEIGHT CODES;

BINARY CODES;

EID: 0035396484     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.930943     Document Type: Article

References (10)

1. Upper bounds for constant-weight codes
2. A new table of constant-weight codes
3. Lower bounds for constant weight codes
4. A lower bound for A(n, 4, w)
5. On certain distributions of integers in pairs with given differences
6. A lower bound for ternary constant weight codes
7. Ternary codes with weight constraints
8. A class of perfect ternary constant-weight codes
9. Constructions of ternary constant-composition codes with weight three