Inequalities for quasi-symmetric designs
Publication
, Journal Article
Calderbank, AR
Published in: Journal of Combinatorial Theory, Series A
January 1, 1988
A 2-design is said to be quasi-symmetric if there are two block intersection sizes. We obtain inequalities satisfied by the parameters of a quasi-symmetric design using linear programming techniques. The same methods apply to codes with covering radius 2 with the property that the number of codewords at distance 2 from a given vector ν depends on the distance of ν from the code. © 1988.
Duke Scholars
Published In
Journal of Combinatorial Theory, Series A
DOI
EISSN
1096-0899
ISSN
0097-3165
Publication Date
January 1, 1988
Volume
48
Issue
1
Start / End Page
53 / 64
Related Subject Headings
- Computation Theory & Mathematics
- 0101 Pure Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Calderbank, A. R. (1988). Inequalities for quasi-symmetric designs. Journal of Combinatorial Theory, Series A, 48(1), 53–64. https://doi.org/10.1016/0097-3165(88)90074-X
Calderbank, A. R. “Inequalities for quasi-symmetric designs.” Journal of Combinatorial Theory, Series A 48, no. 1 (January 1, 1988): 53–64. https://doi.org/10.1016/0097-3165(88)90074-X.
Calderbank AR. Inequalities for quasi-symmetric designs. Journal of Combinatorial Theory, Series A. 1988 Jan 1;48(1):53–64.
Calderbank, A. R. “Inequalities for quasi-symmetric designs.” Journal of Combinatorial Theory, Series A, vol. 48, no. 1, Jan. 1988, pp. 53–64. Scopus, doi:10.1016/0097-3165(88)90074-X.
Calderbank AR. Inequalities for quasi-symmetric designs. Journal of Combinatorial Theory, Series A. 1988 Jan 1;48(1):53–64.
Published In
Journal of Combinatorial Theory, Series A
DOI
EISSN
1096-0899
ISSN
0097-3165
Publication Date
January 1, 1988
Volume
48
Issue
1
Start / End Page
53 / 64
Related Subject Headings
- Computation Theory & Mathematics
- 0101 Pure Mathematics