On the constructions of constant-weight codes

IEEE Transactions on Information Theory

Volumn 44, Issue 1, 1998, Pages 328-333

  Fu, Fang Wei ^a   Han Vinck, A J ^a   Shen, Shi Yi ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; VECTORS;

BINARY CONSTANT WEIGHT CODES; JOHNSON BOUND; PLOTKIN BOUND; SIMPLEX CODES;

BINARY CODES;

EID: 0031699440     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.651060     Document Type: Article

References (15)

1. Q.A. Nguyen, L. Györfi, and J. L. Massey, "Constructions of binary constant-weight cyclic codes and cyclically permutable codes," IEEE Trans. Inform. Theory, vol. 38, pp. 940-949, May 1992
2. G. Mackenzie and J. Seberry, "Maximal ternary codes and Plotkin's bound," Ars Combin., vol. 17A, pp. 251-270, 1984
3. F.J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1981 (3rd printing)
4. 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. 1344-1380, 1990
5. V.A. Zinoviev, "Cascade equal-weight codes and maximal packings," Probl. Contr. Inform. Theory, vol. 12, pp. 3-10, 1983
6. T. Ericson and V. A. Zinoviev, "An improvement of the Gilbert bound for constant-weight codes," IEEE Trans. Inform. Theory, vol. IT-33, pp. 720-723, 1987
7. M. Plotkin, "Binary codes with specified minimum distances," IEEE Trans. Inform. Theory, vol. IT-6, pp. 445-450, 1960
8. S.M. Johnson, "A new upper bound for error-correcting codes," IEEE Trans. Inform. Theory, vol. IT-8, pp. 203-207, 1962
9. A. Barg and S. Litsyn, "DC-constrained codes from Hadamard matrices," IEEE Trans. Inform. Theory, vol. 37, pp. 801-807, 1991.
10. H. van Tilborg and M. Blaum, "On error-correcting balanced codes, IEEE Trans. Inform. Theory, vol. 35, pp. 1091-1095, 1989.
11. M.A. Tsfasman, S. G. Vlädyt, and T. Zink, "Modular curves, Shimur curves and Goppa codes better than the Varshamov-Gilbert bound, Math. Nachrichten., vol. 104, pp. 13-28, 1982.
12. T. Ericson, "Bounds on the size of a code, " in Topics in Coding Theory Lecture Notes in Control and Information Sciences, vol. 128. Berlin Germany: Springer-Verlag, 1989, ch. 2.
13. R.J. M. Vaessens, E. H. L. Aarts, and J. H. van Lint, "Genetic algorithm in coding theory-A table for A3(n,d)," Discr. Appl. Math., vol. 45 pp. 71-87, 1993.
14. T. Etzion, "Optimal constant-weight codes over Z k and generalize designs," Discr. Math., 1997, to be published.
15. K. Phelps and C. Yin, "Generalized Steiner systems," J. Comb. Des. to be published.