Abstract
The role of the finite Fourier transform in the theory of error correcting codes has been explored in a recent text by Richard Blahut. In this work we study how the finite Fourier transform relates to certain polynomial identities involving weight enumerator polynomials of linear codes. These include the generalized MacWilliams identities and theorems originally due to R {\text {R}} . Gleason concerning polynomial algebras containing weight enumerator polynomials. The Heisenberg group model of the finite Fourier transform provides certain algebras of classical theta functions which will be applied to reprove Gleason’s results.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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
