✦ LIBER ✦

A General Construction for Optimal Cyclic Packing Designs

✍ Scribed by Jianxing Yin

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 118 KB
Volume: 97
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2001.3215

No coin nor oath required. For personal study only.

✦ Synopsis

Cyclic packing designs of pairs have various applications in communications. In this paper, the concept of a (g 1 , g 2 , ..., g r ; u)-regular cyclic packing design is defined, and used to establish a quite general recursive construction concerning cyclic packing designs. As corollaries, we are able to unify many known constructions for cyclic designs. As an application, we obtain infinite series of new optimal cyclic packing designs which can be utilized directly to produce new optimal optical orthogonal codes.

📜 SIMILAR VOLUMES

Constructions of optimal packing designs

✍ Jianxing Yin; Ahmed M. Assaf 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views

Let v and k be positive integers. A (v, k, 1)-packing design is an ordered pair (V, B B B) where V is a v-set and B B B is a collection of k-subsets of V (called blocks) such that every 2-subset of V occurs in at most one block of B B B. The packing problem is mainly to determine the packing number

A general construction for group-divisib

A general construction for group-divisible designs

✍ D.R. Stinson 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 911 KB

Majorization for A-optimal designs

✍ N.N Chan; Kim-Hung Li 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 290 KB

Schur-convexity for A-optimal designs

✍ N.N Chan 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Constructing cyclic PBIBD(2)s through an

Constructing cyclic PBIBD(2)s through an optimization approach: Thirty-two new cyclic designs

✍ Luis B. Morales 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

## Abstract We formulate the construction of cyclic partially balanced incomplete block designs with two associate classes (PBIBD(2)s) as a combinatorial optimization problem. We propose an algorithm based on tabu search to tackle the problem. Our algorithm constructed 32 new cyclic PBIBD(2)s. © 20

A construction for block circulant ortho

A construction for block circulant orthogonal designs

✍ H. Kharaghani 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

Corresponding to each odd integer q, we construct a complex orthogonal design. The number of variables and the form of the design depends on the integer q. Almost all of these designs are new and as a corollary we get a new asymptotic existence result for complex Hadamard matrices.