Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/62535
DC FieldValue
dc.titleOn the factorization of polynomials and direct sum properties in integer polyomial rings
dc.contributor.authorGarg, H.K.
dc.date.accessioned2014-06-17T06:52:07Z
dc.date.available2014-06-17T06:52:07Z
dc.date.issued1996
dc.identifier.citationGarg, 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.
dc.identifier.issn0278081X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/62535
dc.description.abstractIn 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.
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentELECTRICAL ENGINEERING
dc.description.sourcetitleCircuits, Systems, and Signal Processing
dc.description.volume15
dc.description.issue3
dc.description.page415-435
dc.description.codenCSSPE
dc.identifier.isiutNOT_IN_WOS
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Page view(s)

42
checked on May 23, 2019

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.