𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Inequalities and bounds for quasi-symmetric 3-designs

✍ Scribed by Rajendra M Pawale


Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
420 KB
Volume
60
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Binary codes and quasi-symmetric designs
✍ A.R. Calderbank; P. Frankl πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 263 KB

obtain a new for the of a -(u, A) design the block intersection st, sZ, . . , s, satisfy sr -sZ-. . . = s, = 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. A 2 -

Quasi-Symmetric Designs and Codes Meetin
✍ Gary McGuire πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 261 KB

We give a characterization of codes meeting the Grey Rankin bound. When the codes have even length, the existence of such codes is equivalent to the existence of certain quasi-symmetric designs. We also find the parameters of all linear codes meeting the Grey Rankin bound. ## 1997 Academic Press T

Quasi-Symmetric Designs with Good Blocks
✍ T. P. McDonough; V. C. Mavron πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 460 KB

The article is concerned with a characterization of quasi-symmetric (QS) designs with intersection numbers 0 and y. It uses the idea of a good block. Such a block G has the property that for any block B with IG n B J = y, every point is on a block containing G n B. It is proved that if a QS design I