Orthogonal transform encoding of cyclic codes

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 229)


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.


Normal Basis Spectral Domain Signal Domain Cyclic Code Minimal Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /Be83a/.
    Beth, T.; Fumy, W.: ‘Hardware-Oriented Algorithms for the Fast Symbolic Calculation of the DFT', Electronics Letters, 19 (1983), 901–902Google Scholar
  2. /Be83b/.
    Beth, T.; Fumy, W.; Mühlfeld, R.: ‘Zur Algebraischen Diskreten Fourier-Transformation', Arch. Math., 40 (1983), 238–244Google Scholar
  3. /Be84/.
    Beth, T.: ‘Verfahren der schnellen Fourier Transformation', (Teubner, Stuttgart, 1984)Google Scholar
  4. /Bl83/.
    Blahut, R.E.: ‘Theory and Practice of Error Control Codes', (Addison-Wesley, Reading, Mass., 1983)Google Scholar
  5. /Ma78/.
    MacWilliams, F.J.; Sloane, N.J.A.: ‘The Theory of Error-Correcting Codes', (North-Holland, Amsterdam, 1978)Google Scholar
  6. /Nu81/.
    Nussbaumer, H.J.: ‘Fast Fourier Transform and Convolution Algorithms', (Springer, Berlin, 1981)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • W. Fumy

There are no affiliations available

Personalised recommendations