Two new fixed polarity linear Kronecker transforms executed over GF(3) are introduced in this article. Both transforms are based on recursive equations using Kronecker products what allows to obtain simple corresponding fast transforms and very regular butterfly diagrams. The computational costs to calculate the new pair of transforms and their experimental comparison with ternary Reed-Muller transform have also been discussed for the purpose of using their error correcting properties that are useful in circuit testing and verification.