Please use this identifier to cite or link to this item:
|Title:||On the factorization of polynomials and direct sum properties in integer polyomial rings||Authors:||Garg, H.K.||Issue Date:||1996||Citation:||Garg, H.K. (1996). On the factorization of polynomials and direct sum properties in integer polyomial rings. Circuits, Systems, and Signal Processing 15 (3) : 415-435. ScholarBank@NUS Repository.||Abstract:||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.||Source Title:||Circuits, Systems, and Signal Processing||URI:||http://scholarbank.nus.edu.sg/handle/10635/62535||ISSN:||0278081X|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 11, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.