On the probability of undetected error and the computational complexity to detect an error for iterated codes
T. Nishijima, Shigeichi Hirasawa · 2002
We discuss the practical and asymptotic capabilities of iterated codes used as error detecting codes. We assume that the codes are binary linear block codes, and the channel is a binary symmetric channel with cross-over probability /spl epsiv/.