A unified framework for recursive construction of detecting matrices

A unified framework for recursive construction of binary, bipolar and ternary detecting matrices is presented. It allows new general constructions to be devised in a systematic manner. These new constructions are summarized in three theorems. Theorem 1 gives a recursive construction of ternary detecting matrices, which include the constructions reported by Cantor and Mills (1966), Chang and Weldon (1979), and by Ferguson (1982 ) as special cases, and is an improvement over Chang's (1984) shortening technique.