Binary codes and quasi-symmetric designs
Publication
, Journal Article
Calderbank, AR; Frankl, P
Published in: Discrete Mathematics
August 1, 1990
We obtain a new necessary condition for the existence of a 2-(υ, k, λ) design where the block intersection sizes s1,s2,...,sn satisfy s1≡s2≡...≡sn≡s( mod 2). This condition eliminates quasi-symmetric 2-(20, 10, 18) and 2-(60, 30, 58) designs. Quasi-symmetric 2- (20, 8, 14) designs are eliminated by an ad hoc coding theoretic argument. © 1990.
Duke Scholars
Published In
Discrete Mathematics
DOI
ISSN
0012-365X
Publication Date
August 1, 1990
Volume
83
Issue
2-3
Start / End Page
201 / 204
Related Subject Headings
- Computation Theory & Mathematics
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Calderbank, A. R., & Frankl, P. (1990). Binary codes and quasi-symmetric designs. Discrete Mathematics, 83(2–3), 201–204. https://doi.org/10.1016/0012-365X(90)90005-3
Calderbank, A. R., and P. Frankl. “Binary codes and quasi-symmetric designs.” Discrete Mathematics 83, no. 2–3 (August 1, 1990): 201–4. https://doi.org/10.1016/0012-365X(90)90005-3.
Calderbank AR, Frankl P. Binary codes and quasi-symmetric designs. Discrete Mathematics. 1990 Aug 1;83(2–3):201–4.
Calderbank, A. R., and P. Frankl. “Binary codes and quasi-symmetric designs.” Discrete Mathematics, vol. 83, no. 2–3, Aug. 1990, pp. 201–04. Scopus, doi:10.1016/0012-365X(90)90005-3.
Calderbank AR, Frankl P. Binary codes and quasi-symmetric designs. Discrete Mathematics. 1990 Aug 1;83(2–3):201–204.
Published In
Discrete Mathematics
DOI
ISSN
0012-365X
Publication Date
August 1, 1990
Volume
83
Issue
2-3
Start / End Page
201 / 204
Related Subject Headings
- Computation Theory & Mathematics
- 0802 Computation Theory and Mathematics
- 0102 Applied Mathematics
- 0101 Pure Mathematics