✦ LIBER ✦

Bounds for Equidistant Permutation Arrays of Index One

✍ Scribed by RUDOLF MATHON

Book ID: 119863023
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 258 KB
Volume: 555
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb22464.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A construction for equidistant permutati

A construction for equidistant permutation arrays of index one

✍ S.A Vanstone; P.J Schellenberg 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 361 KB

On the reconstruction index of permutati

On the reconstruction index of permutation groups: general bounds

✍ Philip Maynard; Johannes Siemons 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 198 KB

A large index theorem for orthogonal arr

A large index theorem for orthogonal arrays, with bounds

✍ Steven J. Rosenberg 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 131 KB

It is shown that for fixed v,k, and t, an orthogonal array A, (v,k, 2) exists for ~2k-21) 2k-t. Information on the number of orthogonal arrays with given parameters, as a function of 2, is also obtained. In this paper v,k, and t will be fixed integers satisfying v>~2 and 1 <~t<~k. Let Iv] denote t

New approach for the ordering of gate pe

New approach for the ordering of gate permutation in one-dimensional logic arrays

✍ Lee, J.; Chou, J.-H.; Fu, S.-L. 📂 Article 📅 1995 🏛 The Institution of Electrical Engineers 🌐 English ⚖ 569 KB

Parallel algorithm for generating permut

Parallel algorithm for generating permutations on linear array

✍ Chau-Jy Lin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Upper bounds on geometric permutations f

Upper bounds on geometric permutations for convex sets

✍ Rephael Wenger 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 408 KB