Abstract
Most of the applications of the DFT in the field of error control coding do not make use of the full power of the transform because the signal domain does not coincide with but is a subfield of the spectral domain. In this paper we develop an algorithm for calculating the IDFT that overcomes the resulting disadvantages. The orthogonal transform encoding of cyclic codes is used for the demonstration of the results.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Beth, T.; Fumy, W.: ‘Hardware-Oriented Algorithms for the Fast Symbolic Calculation of the DFT', Electronics Letters, 19 (1983), 901–902
Beth, T.; Fumy, W.; Mühlfeld, R.: ‘Zur Algebraischen Diskreten Fourier-Transformation', Arch. Math., 40 (1983), 238–244
Beth, T.: ‘Verfahren der schnellen Fourier Transformation', (Teubner, Stuttgart, 1984)
Blahut, R.E.: ‘Theory and Practice of Error Control Codes', (Addison-Wesley, Reading, Mass., 1983)
MacWilliams, F.J.; Sloane, N.J.A.: ‘The Theory of Error-Correcting Codes', (North-Holland, Amsterdam, 1978)
Nussbaumer, H.J.: ‘Fast Fourier Transform and Convolution Algorithms', (Springer, Berlin, 1981)
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fumy, W. (1986). Orthogonal transform encoding of cyclic codes. In: Calmet, J. (eds) Algebraic Algorithms and Error-Correcting Codes. AAECC 1985. Lecture Notes in Computer Science, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16776-5_715
Download citation
DOI: https://doi.org/10.1007/3-540-16776-5_715
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16776-1
Online ISBN: 978-3-540-39855-4
eBook Packages: Springer Book Archive