{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:10:13Z","timestamp":1648998613218},"reference-count":18,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2016,6]]},"abstract":"<jats:p> By embedding a Toeplitz matrix-vector product (MVP) of dimension n into a circulant MVP of dimension [Formula: see text], where \u03b4 can be any nonnegative integer, we present a GF(2<jats:sup>n<\/jats:sup>) multiplication algorithm. This algorithm leads to a new redundant representation, and it has two merits: (1) The flexible choices of \u03b4 make it possible to select a proper N such that the multiplication operation in ring [Formula: see text] can be performed using some asymptotically faster algorithms, e.g. the Fast Fourier Transformation (FFT)-based multiplication algorithm; (2) The redundant degrees, which are defined as N\/n, are smaller than those of most previous GF(2<jats:sup>n<\/jats:sup>) redundant representations, and in fact they are approximately equal to 2 for all applicable cases. <\/jats:p>","DOI":"10.1142\/s0129054116500106","type":"journal-article","created":{"date-parts":[[2016,7,7]],"date-time":"2016-07-07T07:21:04Z","timestamp":1467876064000},"page":"463-478","source":"Crossref","is-referenced-by-count":0,"title":["GF(2<sup><i>n<\/i><\/sup>) Redundant Representation Using Matrix Embedding for Irreducible Trinomials"],"prefix":"10.1142","volume":"27","author":[{"given":"Yongjia","family":"Wang","sequence":"first","affiliation":[{"name":"School of Software, Tsinghua University, Beijing, P. R. China"}]},{"given":"Xi","family":"Xiong","sequence":"additional","affiliation":[{"name":"School of Software, Tsinghua University, Beijing, P. R. China"}]},{"given":"Haining","family":"Fan","sequence":"additional","affiliation":[{"name":"School of Software, Tsinghua University, Beijing, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2016,7,7]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.29"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.199"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1109\/12.713313"},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.64"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.19"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1076"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.152"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1999.0309"},{"key":"p_12","first-page":"339","volume":"1992","author":"Geiselmann W.","year":"2001","journal-title":"LNCS"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1146713"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1214334"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1117\/12.734195"},{"key":"p_16","first-page":"357","volume":"33","author":"Itoh T.","year":"1984","journal-title":"IEEE Transactions on Computers"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1190583"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1985.1164492"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70834"},{"key":"p_23","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1004591"},{"key":"p_24","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2002.1047755"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054116500106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:32:32Z","timestamp":1565199152000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054116500106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":18,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,7,7]]},"published-print":{"date-parts":[[2016,6]]}},"alternative-id":["10.1142\/S0129054116500106"],"URL":"https:\/\/doi.org\/10.1142\/s0129054116500106","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}