Skip to main content

The finite fourier-transform as a modular substitution

  • Conference paper
  • First Online:
  • 154 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 307))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Auslander: Lecture notes on nil-theta functions, AMS, CBMS, no. 34, 1977

    Google Scholar 

  2. Ching-li Chai: Compactification of Siegel moduli schemes, London Math. Soc. Lecture Notes Series, lo7, Cambridge Univ. Press, 1985

    Google Scholar 

  3. D. Mumford: Tata lectures on theta I, Birkhäuser, Boston, 1983

    Google Scholar 

  4. H. Opolka: The finite Fourier transform and theta functions, Proceedings of the AAECC-4 conference, Grenoble, 1985; Springer Lecture Notes in computer science, Vol. 229, p. 156–166

    Google Scholar 

  5. R. Tolimieri: The algebra of the finite Fourier-transform and coding theory, AMS Transactions, 287, 1985, 253–273

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Thomas Beth Michael Clausen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Opolka, H. (1988). The finite fourier-transform as a modular substitution. In: Beth, T., Clausen, M. (eds) Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra. AAECC 1986. Lecture Notes in Computer Science, vol 307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039185

Download citation

  • DOI: https://doi.org/10.1007/BFb0039185

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19200-8

  • Online ISBN: 978-3-540-39133-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics