ABSTRACT
Let t, v, k, and λ be positive integers. A t − (v, k, λ) design is a pair (M ,E ) where M is a set of v elements called points and E = (E1,E2, ...,Eb) is a set of k-subsets of M — called blocks — such that every t-subset of M is contained in exactly λ blocks (see Definition 3.5). It was proved in Theorem 3.3 that t − (v, k, 1) designs can be used to construct perfect A-codes with Pr(0 ≤ r < t) achieving combinatorial bounds.
