New lower bounds for constant weight codes
Authors:
- C.L.M. van PulCPC.L.M. van Pul
- T. EtzionTET. Etzion
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 35 (6) , 1324-1329
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Some lower bounds for constant weight codesDiscrete Applied Mathematics, 1987
- One‐factorizations of the complete graph—A surveyJournal of Graph Theory, 1985
- Spectral enumerators for certain additive-error-correcting codes over integer alphabetsInformation and Control, 1981
- A lower bound forA(n,4,w)(Corresp.)IEEE Transactions on Information Theory, 1981
- A few new constant weight codes (Corresp.)IEEE Transactions on Information Theory, 1980
- Some new constant weight codes (Corresp.)IEEE Transactions on Information Theory, 1980
- Lower bounds for constant weight codesIEEE Transactions on Information Theory, 1980
- On the maximum number of disjoint Steiner triple systemsDiscrete Mathematics, 1973
- Covering all triples on n marks by disjoint Steiner systemsJournal of Combinatorial Theory, Series A, 1973
- A new upper bound for error-correcting codesIEEE Transactions on Information Theory, 1962