A note on aliasing probability for multiple input signature analyzer

Recently D.K. Pradhan, S.K. Gupta and M.G. Karpovsky (1990) affirmed that the codes generated by (x-α)(x-β) were not Reed-Solomon, where α and β were roots of the distinct primitive polynomials of degree m. It was assumed that β=α ⁸, where s-1 and 2^m-1 were mutually prime. The authors show that under the above assumption the respective codes are Reed-Solomon codes