Matrix Factorization and Some Fast Discrete Transforms

In this paper, three discrete transforms related to vector spaces over finite fields are studied. For our purposes, and according to the properties of the finite fields, the most suitable transforms are as follows: for binary fields, this is the Walsh–Hadamard transform; for odd prime fields, the Vilenkin–Chrestenson transform; and for composite fields, the trace transform. A factorization of the transform matrices using Kronecker power is given so that the considered discrete transforms are reduced to the fast discrete transforms. Examples and applications are also presented of the considered transforms in coding theory for calculating the weight distribution of a linear code.