Bounds on the Error Probability for Certain Ensembles of Random Codes

Two classes of random codes are considered, for which (unlike the standard situation in information theory) the code words are not independent. These codes arise in investigating Boolean and linear models of the design of screening experiments. Upper and lower bounds are obtained for the mean error probability over the ensemble of codes, for transmission over a memoryless channel and with maximum-likelihood decoding.