✦ LIBER ✦

Bounds on the number of constraints for balanced arrays of strength t

✍ Scribed by G.M. Saha; Rahul Mukerjee; Sanpei Kageyama

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 686 KB
Volume: 18
Category: Article
ISSN: 0378-3758
DOI: 10.1016/0378-3758(88)90010-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Existence of 2-symbol balanced arrays of

Existence of 2-symbol balanced arrays of strength t and t+2 constraints

✍ Shinji Kuriki 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 452 KB

Some general existence conditions for ba

Some general existence conditions for balanced arrays of strength t and 2 symbols

✍ J.N Srivastava 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Bounds for the number of common symbols

Bounds for the number of common symbols in balanced and certain partially balanced designs

✍ K.A Bush 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Bound on integrals: Elimination of the d

Bound on integrals: Elimination of the dual and reduction of the number of equality constraints

✍ F. De Vylder 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 644 KB

On the weak law of large numbers for arr

On the weak law of large numbers for arrays

✍ Dug Hun Hong; Kwang Sik Oh 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 114 KB

The decomposability of simple orthogonal

The decomposability of simple orthogonal arrays on 3 symbols having t + 1 rows and strength t

✍ Wiebke S. Diestelkamp 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

It is well-known that all orthogonal arrays of the form OANY t 1Y 2Y t are decomposable into ! orthogonal arrays of strength t and index 1. While the same is not generally true when s 3, we will show that all simple orthogonal arrays of the form OANY t 1Y 3Y t are also decomposable into orthogonal a