In this paper, an expression for the undetected error probability

of single parity-check product (SPCP) codes used for error detection over a binary symmetric channel is derived. It is shown that square SPCP codes need not obey a certain commonly used bound. Approximate expressions for the maximum

and the corresponding maximizing ε are given.