Incomplete MOLS

R. Julian R. Abel; Charles Colbourn; Jeffrey H. Dinitz

Incomplete MOLS

R. Julian R. Abel, Charles Colbourn, Jeffrey H. Dinitz

Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter

7 Scopus citations

Abstract

Again, when λ = 1, it can be omitted from the notation. An ITD(k, n; b₁,..., b_s) is also denoted as a TD(k, n)−∑^s _i=1 TD(k, b_i). 4.11 Theorem r-IMOLS(n; b₁,..., b_s) is equivalent to 1. an incomplete transversal design ITD(r + 2, n; b₁,..., b_s); 2. an incomplete orthogonal array IOA(r + 2, n; b₁,..., b_s).

Original language	English (US)
Title of host publication	Handbook of Combinatorial Designs, Second Edition
Publisher	CRC Press
Pages	193-211
Number of pages	19
ISBN (Electronic)	9781420010541
ISBN (Print)	9781584885061
State	Published - Jan 1 2006

ASJC Scopus subject areas

General Mathematics
General Computer Science

Cite this

@inbook{9b71403f8e6d4208a0e2f1e23b04ec22,

title = "Incomplete MOLS",

abstract = "Again, when λ = 1, it can be omitted from the notation. An ITD(k, n; b1,..., bs) is also denoted as a TD(k, n)−∑s i=1 TD(k, bi). 4.11 Theorem r-IMOLS(n; b1,..., bs) is equivalent to 1. an incomplete transversal design ITD(r + 2, n; b1,..., bs); 2. an incomplete orthogonal array IOA(r + 2, n; b1,..., bs).",

author = "Abel, {R. Julian R.} and Charles Colbourn and Dinitz, {Jeffrey H.}",

year = "2006",

month = jan,

day = "1",

language = "English (US)",

isbn = "9781584885061",

pages = "193--211",

booktitle = "Handbook of Combinatorial Designs, Second Edition",

publisher = "CRC Press",

}

TY - CHAP

T1 - Incomplete MOLS

AU - Abel, R. Julian R.

AU - Colbourn, Charles

AU - Dinitz, Jeffrey H.

PY - 2006/1/1

Y1 - 2006/1/1

N2 - Again, when λ = 1, it can be omitted from the notation. An ITD(k, n; b1,..., bs) is also denoted as a TD(k, n)−∑s i=1 TD(k, bi). 4.11 Theorem r-IMOLS(n; b1,..., bs) is equivalent to 1. an incomplete transversal design ITD(r + 2, n; b1,..., bs); 2. an incomplete orthogonal array IOA(r + 2, n; b1,..., bs).

AB - Again, when λ = 1, it can be omitted from the notation. An ITD(k, n; b1,..., bs) is also denoted as a TD(k, n)−∑s i=1 TD(k, bi). 4.11 Theorem r-IMOLS(n; b1,..., bs) is equivalent to 1. an incomplete transversal design ITD(r + 2, n; b1,..., bs); 2. an incomplete orthogonal array IOA(r + 2, n; b1,..., bs).

UR - http://www.scopus.com/inward/record.url?scp=62849113235&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=62849113235&partnerID=8YFLogxK

M3 - Chapter

AN - SCOPUS:62849113235

SN - 9781584885061

SP - 193

EP - 211

BT - Handbook of Combinatorial Designs, Second Edition

PB - CRC Press

ER -

Incomplete MOLS

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this