caa a22 4500 477097030 CHVBK 20180405111530.0 cr unu---uuuuu 170330e19960501xx s 000 0 eng 10.1007/BF01182595 doi (NATIONALLICENCE)springer-10.1007/BF01182595 Garg Hari Department of Electrical Engineering, National University of Singapore, 10 Kent Ridge Crescent, 0511, Singapore aut On the factorization of polynomials and direct sum properties in integer polyomial rings [Elektronische Daten] [Hari Garg] In our recent work, we solved the word sequence length constraint problem associated with number theoretic transforms defined in finite integer rings. This is based on the American-Indian-Chinese extension of the Chinese remainder theorem. This work builds further on the results by extending them to the domain of integer polynomial rings. The theory of polynomial factorization and the resulting direct sum property are studied in depth. The emphasis is on the theory of computational algorithms for processing sequences defined in finite integer and complex integer rings. Birkhäuser Boston, 1996 Circuits, Systems and Signal Processing Birkhäuser-Verlag 15/3(1996-05-01), 415-435 0278-081X 15:3<415 1996 15 34 https://doi.org/10.1007/BF01182595 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF01182595 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Garg Hari Department of Electrical Engineering, National University of Singapore, 10 Kent Ridge Crescent, 0511, Singapore aut NATIONALLICENCE 773 0- Circuits, Systems and Signal Processing Birkhäuser-Verlag 15/3(1996-05-01), 415-435 0278-081X 15:3<415 1996 15 34 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer