Introduction to Abstract Algebra

  • R. Tolimieri
  • Myoung An
  • Chao Lu
Part of the Signal Processing and Digital Filtering book series (SIGNAL PROCESS)

Abstract

In this and the next chapters, we present several mathematical results needed to design the algorithms of the text. We assume that the reader has some knowledge of groups, rings and vector spaces but no extensive knowledge is required. Instead, we focus on those mathematical objects which will be used repeatedly in this text.

Keywords

Finite Field Unit Group Polynomial Ring Great Common Divisor Irreducible 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ireland and Rosen A Classical Introduction to Modern Number Theory, Springer-Verlag 1980.Google Scholar
  2. [2]
    Halmos, P. R. Finite-Dimensional Vector Spaces, Springer-Verlag 1974.Google Scholar
  3. [3]
    Herstein, I. N. Topics in Algebra, XEROX College Publishing, 1964.Google Scholar

References of Preface

  1. [1]
    Heideman, M. T., Johnson, D. H. and Burrus, C. S. “Gauss and the History of the Fast Fourier Transform”, IEEE ASSP Magazine, October 1984.Google Scholar
  2. [2]
    Cooley, J. W. and Tukey, J. W. “An Algorithm for the Machine Calculation of Complex Fourier Series”, Math. Comp., vol. 19, No. 2.Google Scholar

Copyright information

© Springer Science+Business Media New York 1989

Authors and Affiliations

  • R. Tolimieri
    • 1
  • Myoung An
    • 1
  • Chao Lu
    • 1
  1. 1.Center for Large Scale ComputingCity University of New YorkNew YorkUSA

Personalised recommendations