✦ LIBER ✦

Counting patterns in colored orthogonal arrays

✍ Scribed by Montejano, Amanda; Serra, Oriol

Book ID: 122248761
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 417 KB
Volume: 317
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2013.11.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Colored Orthogonal Range Count

Efficient Colored Orthogonal Range Counting

✍ Kaplan, Haim; Rubin, Natan; Sharir, Micha; Verbin, Elad 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 365 KB

Counting the number of fault patterns in

Counting the number of fault patterns in redundant VLSI arrays

✍ Linda Pagli; Geppino Pucci 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Critical Sets in Orthogonal Arrays

✍ Rita SahaRay; Jennifer Seberry 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 79 KB

A critical set consists of the minimum amount of information needed to recreate combinatorial structures uniquely. A minimal critical set is a critical set of minimum cardinality. In this paper we consider orthogonal arrays constructed from Mutually Orthogonal Latin Squares (MOLS) and obtain bounds

Counting patterns in graphs

✍ Guido Guardabassi 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 326 KB

Antenna array design by the orthogonal m

Antenna array design by the orthogonal method in conjunction with element patterns

✍ Z. D. Zaharis; T. Samaras; E. Vafiadis; J. N. Sahalos 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 800 KB

A new approach in constructing orthogona

A new approach in constructing orthogonal and nearly orthogonal arrays

✍ Chang-Xing Ma; Kai-Tai Fang; Erkki Liski 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 146 KB