✦ LIBER ✦

Combinatorial designs and related systems

✍ Scribed by W.G Bridges; H.J Ryser

Publisher: Elsevier Science
Year: 1969
Tongue: English
Weight: 693 KB
Volume: 13
Category: Article
ISSN: 0021-8693
DOI: 10.1016/0021-8693(69)90085-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A problem of combinatorial designs relat

A problem of combinatorial designs related to authentication codes

✍ Dingyi Pei 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 433 KB 👁 2 views

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities Pr of successful deception in an optimum spoofing attack of order r for r = 0, 1, . . . , t -1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially

Combinatorial designs related to the str

Combinatorial designs related to the strong perfect graph conjecture

✍ V. Chvátal; R.L. Graham; A.F. Perold; S.H. Whitesides 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Simple solutions of these matrix equations are easy to find; we describe ways of cortstructing rather messy ones. Our investigations are motivated by an intimate relationship between the pairs X, Y and minimal imperfect graphs.

G-designs and related designs

✍ Kazuhiko Ushio 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 763 KB

Ushio, K., G-designs and related designs, Discrete Mathematics 116 (1993) 2999311. This is a survey on the existence of G-designs, bipartite G-designs and multipartite G-designs. organization scheme problems about BFS2, HUBFS2, BMFSz and HUBMFS,. They can be solved by constructing (u, k, 1) K,-de

Super-simple holey Steiner pentagon syst

Super-simple holey Steiner pentagon systems and related designs

✍ R. Julian R. Abel; Frank E. Bennett; Gennian Ge 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 256 KB

## Abstract A Steiner pentagon system of order __v__ (SPS(__v__)) is said to be super‐simple if its underlying (__v__, 5, 2)‐BIBD is super‐simple; that is, any two blocks of the BIBD intersect in at most two points. It is well known that the existence of a holey Steiner pentagon system (HSPS) of ty

New constructions for perfect hash famil

New constructions for perfect hash families and related structures using combinatorial designs and codes

✍ D. R. Stinson; R. Wei; L. Zhu 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB 👁 1 views

In this paper, we consider explicit constructions of perfect hash families using combinatorial methods. We provide several direct constructions from combinatorial structures related to orthogonal arrays. We also simplify and generalize a recursive construction due to Atici, Magliversas, Stinson and

Incidence matrices and inequalities for

Incidence matrices and inequalities for combinatorial designs

✍ D. Raghavarao; S.S. Shrikhande; M.S. Shrikhande 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract In this paper we use incidence matrices of block designs and row–column designs to obtain combinatorial inequalities. We introduce the concept of nearly orthogonal Latin squares by modifying the usual definition of orthogonal Latin squares. This concept opens up interesting combinatoria