𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An intersection problem for codes

✍ Scribed by P. Frankl

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
347 KB
Volume
84
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let [s]" denote all sequences a' = (a,, . . , a,) of integers with 1 <xi 2 S. Consider a subset A of [s]". It is called (t,, . . , &)-intersecting if for any two members ci, b E A and any 1 s i < s

πŸ“œ SIMILAR VOLUMES

An evolutionary method for general surfa
An evolutionary method for general surface-surface intersection problems
✍ N.W. Cho; N.K. Kim; Y. Kim; S.-H. Kang πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 364 KB

A new approach to surface-surface intersection problems is proposed. Surface-surface intersection forms a fundamental function in computational geometry and geometric modeling. A geometric modeler needs to be equipped with a robust and accurate SSI algorithm to deal with a wide range of complex mode

The intersection problem for m-cycle sys
The intersection problem for m-cycle systems
✍ Elizabeth J. Billington πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 794 KB

Let Z,(v) denote the set of integers k for which a pair of m-cycle systems of K , exist, on the same vertex set, having k common cycles. Let J,(v) = { 0,1,2, . . . ,t, -2, t,} where t , = v(vl ) / 2 m . In this article, if 2mn + x is an admissible order of an m-cycle system, we investigate when Zm(2

The intersection problem for K4 - e desi
The intersection problem for K4 - e designs
✍ Elizabeth J. Billington; M. Gionfriddo; C.C. Lindner πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 886 KB

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph Kn and B is an edge-disjoint decomposition of Kn into copies of the simple graph G. Following design terminology, we call these copies "blocks". Here/Β£4 -e denotes the complete graph K4 with one edge removed. It is