New Lower Bounds for Constant Weight Codes

IEEE Transactions on Information Theory

Volumn 35, Issue 6, 1989, Pages 1324-1329

  Van Pul, Cornelis L M ^a   Etzion, Tuvi ^b  

^a PHILIPS RESEARCH LABORATORIES   (Germany)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--HEURISTIC;

CODE LOWER BOUNDS; CODING/DECODING; CONSTANT WEIGHT CODES;

CODES, SYMBOLIC;

EID: 0024768229     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.45293     Document Type: Article

References (15)

1. R. L. Graham and N. J. A. Sloane, “Lower bounds for constant weight codes.” IEEE Trans. Inform. Theory, vol. IT-26, pp. 37-43. Jan. 1980.
2. T. Kløvc. “Lower bound for A(n, 4, w),” IEEE Trans. Inform. Theory, vol. IT-27, pp. 257-258, Mar. 1981.
3. R. E. Kibler, “Some new constant weight codes,” IEEE Trans. Inform. Theory, vol. IT-26. pp. 364-365, May 1980.
4. A. E. Brouwer, “A few new constant weight codes,” IEEE Trans. Inform. Theory, vol. IT-26, p. 366, May 1980.
5. P. Delsarte and P. Piret, “Spectral enumerators for certain additive-error-correcting codes over integer alphabets,” Inform. Contr., vol. 48, pp. 193-210, 1981.
6. E. Mendelsohn and A. Rosa, “One-factorization of the complete graph A survey,” J. Graph Theory, vol. 9, pp. 43-65, 1985.
7. T. P. Kirkman, “Note on an unanswered prize question,” Cambridge and Dublin Math. J., vol. 5, pp. 255-262, 1850.
8. S. Sehreiber. “Covering all triples on n marks by disjoint Steiner systems.” J. Combin. Theory, scr. A, vol. 15, pp. 347-350, 1973.
9. R. H. F. Denniston. “Some packing with Steiner triple systems,” Discrete Math., vol. 9, pp. 213-227, 1974.
10. L. Teirlinck, “On the maximum number of disjoint Steiner triple systems,” Discrete Math., vol. 6, pp. 299-230, 1973.
11. S. M. Johnson, “A new upper bound for error-correcting codes.” IEEE Trans. Inform. Theory, vol. IT-8, pp. 203-207, 1962.
12. I. Honkala, H. Hämäläinen. and M. Kaikonen, “Some lower bounds for constant weight codes,” Discrete Appl. Math., vol. 18, pp. 95-98, 1987.
13. H. C. A. van Tilborg and M. Blaum, “On error-correcting balanced codes.” submitted for publication.
14. C. L. M. van Pul. “Some distance problems in coding theory,” Ph.D. dissertation. Technical Univ. of Eindhoven, Eindhoven, The Netherlands. Jan. 1987.
15. A. E. Brouwer. J. B. Shearer, N. J. A. Sloane and W. D. Smith, “A new table of constant weight codes.” preprint.