Introduction to Abstract Algebra
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.
KeywordsFinite Field Unit Group Polynomial Ring Great Common Divisor Irreducible Polynomial
Unable to display preview. Download preview PDF.
- Ireland and Rosen A Classical Introduction to Modern Number Theory, Springer-Verlag 1980.Google Scholar
- Halmos, P. R. Finite-Dimensional Vector Spaces, Springer-Verlag 1974.Google Scholar
- Herstein, I. N. Topics in Algebra, XEROX College Publishing, 1964.Google Scholar
References of Preface
- 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
- 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