The Community for Technology Leaders
Green Image
<p>Recently D.K. Pradhan, S.K. Gupta and M.G. Karpovsky (1990) affirmed that the codes generated by (x- alpha )(x- beta ) were not Reed-Solomon, where alpha and beta were roots of the distinct primitive polynomials of degree m. It was assumed that beta = alpha /sup 8/, where s-1 and 2/sup m/-1 were mutually prime. The authors show that under the above assumption the respective codes are Reed-Solomon codes.</p>
aliasing probability; multiple input signature analyzer; distinct primitive polynomials; Reed-Solomon codes; logic analysers; logic testing; Reed-Solomon codes.

K. Iwasaki and M. Morii, "A Note on Aliasing Probability for Multiple Input Signature Analyzer," in IEEE Transactions on Computers, vol. 42, no. , pp. 1152, 1993.
91 ms
(Ver 3.3 (11022016))