Abstract
RTDλ(k, n). Its λ-parallel classes are B1,..., Bn. This process can be reversed to form a TDλ(k + 1, n) from an RTDλ(k, n). 3.14 Example A resolvable TD(4, 4) derived from the TD(5, 4) in Example 3.11. On the element set {1, 2, 3, 4}× {2, 3, 4, 5}, the blocks are: (equation found) Each row is a parallel class.
Original language | English (US) |
---|---|
Title of host publication | Handbook of Combinatorial Designs, Second Edition |
Publisher | CRC Press |
Pages | 160-193 |
Number of pages | 34 |
ISBN (Electronic) | 9781420010541 |
ISBN (Print) | 9781584885061 |
State | Published - Jan 1 2006 |
ASJC Scopus subject areas
- Mathematics(all)
- Computer Science(all)