✦ LIBER ✦

A new upper bound on the parameters of quasi-symmetric designs

✍ Scribed by Ghosh, Debashis; Dey, Lakshmi Kanta

Book ID: 122936899
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 127 KB
Volume: 113
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.03.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Bound on the Number of Designs wit

A New Bound on the Number of Designs with Classical Affine Parameters

✍ Clement Lam; Vladimir D. Tonchev 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 70 KB

A Proof of the Jungnickel-Tonchev Conjec

A Proof of the Jungnickel-Tonchev Conjecture on Quasi-Multiple Quasi-Symmetric Designs

✍ Sharad Sane 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 53 KB

Exponential number of quasi-symmetric SD

Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound

✍ D. Jungnickel; Vladimir D. Tonchev 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 352 KB

A short proof of a conjecture on quasi-s

A short proof of a conjecture on quasi-symmetric 3-designs

✍ Rajendra M. Pawale; Sharad S. Sane 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 150 KB

Pawale, R.M. and S.S. Sane, A short p,oof of a conjecture on quasi-symmetric 2-designs, Discrete Mathematics 96 (1991) 71-74. It was conjettured by Sane and M.S. Shrikhande that the only nontrivial quasi-symmetric 3-design with the smaller block intersection number one is either the Witt 4-(23, 7,

Upper bound on the characters of the sym

Upper bound on the characters of the symmetric groups

✍ Yuval Roichman 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 409 KB

New upper bounds on the minimum size of

New upper bounds on the minimum size of covering designs

✍ Iliya Bluskov; Heikki Hämäläinen 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

Let D = {B1 , B2 , . . . , B b } be a finite family of k-subsets (called blocks) of a vset X(v) = {1, 2, . . . , v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size