𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial designs and perfect codes

✍ Scribed by Kevin T. Phelps

Book ID
104444320
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
230 KB
Volume
10
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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.