Bounds and constructions for ternary constant-composition codes

IEEE Transactions on Information Theory

Volumn 48, Issue 1, 2002, Pages 101-111

  Svanström, Mattias ^a,b   Östergård, Patrie R J ^a,c   Bogdanova, Galina T ^d  

^a IEEE   (Sweden)

^b LINKÖPING UNIVERSITY   (Sweden)

^c AALTO UNIVERSITY   (Finland)

^d BULGARIAN ACADEMY OF SCIENCES   (Bulgaria)

Author keywords

Constant weight codes; Nonbinary codes; Weight constraints

Indexed keywords

COMPUTER SEARCH; CONSTANT-WEIGHT CODES; HAMMING DISTANCE; JOHNSON BOUND; JUXTAPOSITION; TERNARY CODES; WEIGHT CONSTRAINTS;

CALCULATIONS; COMPUTER APPLICATIONS; CONSTRAINT THEORY; FUNCTIONS; MATRIX ALGEBRA; THEOREM PROVING;

CODES (SYMBOLS);

EID: 0036158531     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.971741     Document Type: Article

References (17)

1. Bounds for the maximum size of ternary constant composition weight codes
2. Some ternary constant-composition codes
3. Bounds on mixed binary/ternary codes
4. A new table of constant weight codes
5. The noising method: A new method for combinatorial optimization
6. Lexicographic codes: Error-correcting codes from game theory
7. On the nonexistence of generalized Hadamard matrices
8. On the constructions of constant-weight codes
9. Tabu search-Part I
10. A new upper bound for error-correcting codes
11. Maximal ternary codes and Plotkin's bound
12. A new algorithm for the maximum-weight clique problem
13. Ternary codes with weight constraints
14. Constructions of ternary constant-composition codes with weight three
15. 3 (n, d)