Abstract
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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
