Constructions of ternary constant-composition codes with weight three

IEEE Transactions on Information Theory

Volumn 46, Issue 7, 2000, Pages 2644-2647

  Svanström, Mattias ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; CONSTRAINT THEORY; MATRIX ALGEBRA; THEOREM PROVING; TREES (MATHEMATICS); VECTORS;

CONSTANT WEIGHT CODES; NONBINARY CODES; TERNARY CONSTANT COMPOSITION CODES; WEIGHT TREE;

BINARY CODES;

EID: 0034318232     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.887875     Document Type: Article

References (8)

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. C. Mackenzie and J. Seberry, Maximal ternary codes and Plotkin's bound," Ars Combinatoria, vol. 17A, pp. 251-270, 1984.
3. R. J. M. Vaessens, E. H. L. Aarts, and J. H. van Lint, Genetic algorithms in coding theory-A table for A3(n, d)," Discr.Appl. Math., vol. 45, pp. 71-87, 1993.
4. A. E. Brouwer, H. O. Hämäläinen, P. R. J. Östergard, and N. J. A. Sloane, Bounds on mixed binary/ternary codes, IEEE Trans. Inform. Theory, vol. 44, pp. 140-161, Jan. 1998.
5. G. T. Bogdanova and D. S. Ocetarova, Some ternary constant-composition codes," in Proc. 6th Int. Workshop on Algebraic and Combinatorial Coding Theory, Pskov, Russia, Sept. 1998, pp. 4115.
6. M. Svanström, Ternary Codes with Weight Constraints," Ph.D. dissertation no. 572, Linköpings Universitet, Linköping, Sweden, 1999.
7. T. Ericson and V. Zinoviev, Spherical codes generated by binary partitions of symmetric pointsets, IEEE Trans. Inform. Theory, vol. 41, pp. 107-129, Jan. 1995.
8. S. M. Johnson, A new upper bound for error-correcting codes, IRE Trans. Inform. Theory, vol. IT-8, pp. 203-207, Apr. 1962.