A coding theoretic approach to extending designs
- 15 July 1995
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 142 (1-3) , 155-168
- https://doi.org/10.1016/0012-365x(94)00010-g
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Combinatorics of finite setsPublished by Cambridge University Press (CUP) ,2006
- On designs and formally self-dual codesDesigns, Codes and Cryptography, 1994
- Orphan structure of the first-order Reed-Muller codesDiscrete Mathematics, 1992
- Weight enumerators of self-dual codesIEEE Transactions on Information Theory, 1991
- Orphans of the first order Reed-Muller codesIEEE Transactions on Information Theory, 1990
- A new upper bound on the minimal distance of self-dual codesIEEE Transactions on Information Theory, 1990
- On the coveting radius of extremal self-dual codesIEEE Transactions on Information Theory, 1983
- New uniqueness proofs for the (5, 8, 24), (5, 6, 12) and related Steiner systemsJournal of Combinatorial Theory, Series A, 1982
- On the enumeration of self-dual codesJournal of Combinatorial Theory, Series A, 1980
- Generalized quadratic residue codesIEEE Transactions on Information Theory, 1978