Abstract

The author discusses a comment by W.H. Mow (IEEE Trans. Signal Processing, vol. 42, no. 7, p. 1876, 1994) on his original paper (Fourdain, IEEE Trans. Signal Processing, vol. 39, p. 1427-8, 1991). In the original paper, the principal goal was to introduce the concept of a reduced list of independent roots (for binary codes) under the basic eight transformations T1 to T8. However, he agrees that the indicated relations for equivalence in Table 1 are valid only for odd length sequences. Concerning the isomorphisms and the relations of equivalence for even length sequences, the remarks presented by W.H. Mow are correct, leading to Table 1bis.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call