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 -
β¦ LIBER β¦
Quasi-symmetric designs, codes, quadrics, and hyperplane sections
β Scribed by Vladimir D. Tonchev
- Book ID
- 105139474
- Publisher
- Springer
- Year
- 1993
- Tongue
- English
- Weight
- 697 KB
- Volume
- 48
- Category
- Article
- ISSN
- 0046-5755
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
Self-Complementary Balanced Codes and Qu
β
Fang-Wei Fu; Victor K.-W. Wei
π
Article
π
2002
π
Springer
π
English
β 74 KB
On symmetric and quasi-symmetric designs
β
Dieter Jungnickel; Vladimir D Tonchev
π
Article
π
1992
π
Elsevier Science
π
English
β 659 KB
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
Partitioning Quadrics, Symmetric Group D
β
Aiden A. Bruen; David L. Wehlau
π
Article
π
1997
π
Springer
π
English
β 291 KB
Linear codes and doubly transitive symme
β
Christopher Parker; Vladimir D. Tonchev
π
Article
π
1995
π
Elsevier Science
π
English
β 556 KB