Improved Polynomial Multiplication Formulas Over F2 Using Chinese Remainder Theorem
| dc.contributor.author | Ozbudak, Ferruh | |
| dc.contributor.author | Cenk, Murat | |
| dc.date.accessioned | 2016-06-06T10:49:30Z | |
| dc.date.accessioned | 2025-09-18T16:08:13Z | |
| dc.date.available | 2016-06-06T10:49:30Z | |
| dc.date.available | 2025-09-18T16:08:13Z | |
| dc.date.issued | 2009 | |
| dc.description | Ozbudak, Ferruh/0000-0002-1694-9283; Cenk, Murat/0000-0003-4941-8734 | en_US |
| dc.description.abstract | Let n and l be positive integers and f(x) be an irreducible polynomial over F-2 such that ldeg(f(x)) < 2n - 1. We obtain an effective upper bound for the multiplication complexity of n-term polynomials modulo f(x)(l). This upper bound allows a better selection of the moduli when the Chinese Remainder Theorem is used for polynomial multiplication over F-2. We give improved formulas to multiply polynomials of small degree over F-2. In particular, we improve the best known multiplication complexities over F-2 in the literature in some cases. | en_US |
| dc.description.sponsorship | NTU [M58110003]; TUBITAK [TBAG-107T826] | en_US |
| dc.description.sponsorship | The authors would like to thank the anonymous reviewers for the useful comments. Ferruh Ozbudak was supported by NTU Research Grant M58110003. A part of this paper was written while Ferruh Ozbudak was visiting the Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Nanyang Technological University, and would like to thank the institute for the hospitality. This work was supported by TUBITAK under Grant TBAG-107T826. | en_US |
| dc.identifier.citation | Cenk, M., Özbudak, F. (2009). Improved polynomial multiplication formulas over F-2 using chinese remainder theorem. IEEE Transactions on Computers, 58(4), 572-576. http://dx.doi.org/ 10.1109/TC.2008.207 | en_US |
| dc.identifier.doi | 10.1109/TC.2008.207 | |
| dc.identifier.issn | 0018-9340 | |
| dc.identifier.issn | 1557-9956 | |
| dc.identifier.scopus | 2-s2.0-63049100179 | |
| dc.identifier.uri | https://doi.org/10.1109/TC.2008.207 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12416/14979 | |
| dc.language.iso | en | en_US |
| dc.publisher | Ieee Computer Soc | en_US |
| dc.relation.ispartof | IEEE Transactions on Computers | |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | Finite Field Polynomial Multiplication | en_US |
| dc.subject | Chinese Remainder Theorem | en_US |
| dc.title | Improved Polynomial Multiplication Formulas Over F2 Using Chinese Remainder Theorem | en_US |
| dc.title | Improved polynomial multiplication formulas over F-2 using chinese remainder theorem | tr_TR |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| gdc.author.id | Ozbudak, Ferruh/0000-0002-1694-9283 | |
| gdc.author.id | Cenk, Murat/0000-0003-4941-8734 | |
| gdc.author.scopusid | 6504402955 | |
| gdc.author.scopusid | 6603589033 | |
| gdc.author.wosid | Ozbudak, Ferruh/Aaz-6893-2020 | |
| gdc.author.wosid | Cenk, Murat/Agu-7577-2022 | |
| gdc.author.yokid | 220172 | |
| gdc.bip.impulseclass | C4 | |
| gdc.bip.influenceclass | C4 | |
| gdc.bip.popularityclass | C5 | |
| gdc.coar.access | metadata only access | |
| gdc.coar.type | text::journal::journal article | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | Çankaya University | en_US |
| gdc.description.departmenttemp | [Cenk, Murat] Cankaya Univ, Dept Math & Comp Sci, TR-06530 Ankara, Turkey; [Ozbudak, Ferruh] Middle E Tech Univ, Dept Math, TR-06530 Ankara, Turkey; [Ozbudak, Ferruh] Middle E Tech Univ, Inst Appl Math, TR-06530 Ankara, Turkey | en_US |
| gdc.description.endpage | 576 | en_US |
| gdc.description.issue | 4 | en_US |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q2 | |
| gdc.description.startpage | 572 | en_US |
| gdc.description.volume | 58 | en_US |
| gdc.description.woscitationindex | Science Citation Index Expanded | |
| gdc.description.wosquality | Q2 | |
| gdc.identifier.openalex | W2132571841 | |
| gdc.identifier.wos | WOS:000263526500010 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.impulse | 8.0 | |
| gdc.oaire.influence | 4.693593E-9 | |
| gdc.oaire.isgreen | false | |
| gdc.oaire.popularity | 2.651944E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0202 electrical engineering, electronic engineering, information engineering | |
| gdc.oaire.sciencefields | 0102 computer and information sciences | |
| gdc.oaire.sciencefields | 02 engineering and technology | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 5.0758 | |
| gdc.openalex.normalizedpercentile | 0.95 | |
| gdc.openalex.toppercent | TOP 10% | |
| gdc.opencitations.count | 17 | |
| gdc.plumx.crossrefcites | 17 | |
| gdc.plumx.mendeley | 2 | |
| gdc.plumx.scopuscites | 17 | |
| gdc.publishedmonth | 4 | |
| gdc.scopus.citedcount | 17 | |
| gdc.virtual.author | Cenk, Murat | |
| gdc.wos.citedcount | 12 | |
| relation.isAuthorOfPublication | c113b273-5f48-4f7d-9923-6d43468a5794 | |
| relation.isAuthorOfPublication.latestForDiscovery | c113b273-5f48-4f7d-9923-6d43468a5794 | |
| relation.isOrgUnitOfPublication | 26a93bcf-09b3-4631-937a-fe838199f6a5 | |
| relation.isOrgUnitOfPublication | 28fb8edb-0579-4584-a2d4-f5064116924a | |
| relation.isOrgUnitOfPublication | 0b9123e4-4136-493b-9ffd-be856af2cdb1 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 26a93bcf-09b3-4631-937a-fe838199f6a5 |