{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T18:21:36Z","timestamp":1648664496221},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,1,24]],"date-time":"2006-01-24T00:00:00Z","timestamp":1138060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s00607-005-0154-y","type":"journal-article","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T09:54:43Z","timestamp":1138182883000},"page":"179-203","source":"Crossref","is-referenced-by-count":2,"title":["A New Sparse Gaussian Elimination Algorithm and the Niederreiter Linear System for Trinomials over F2"],"prefix":"10.1007","volume":"77","author":[{"given":"Fatima K.","family":"Abu Salem","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"154_CR1","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1090\/S0025-5718-99-01008-X","volume":"68","author":"P. Roelse","year":"1999","journal-title":"Math. Comp."},{"key":"154_CR2","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1090\/S0025-5718-03-01494-7","volume":"72","author":"P. Fleischmann","year":"2003","journal-title":"Math. Comp."},{"key":"154_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1090\/conm\/168\/01691","volume":"168","author":"S. Gao","year":"1994","journal-title":"Contemp. Math."},{"key":"154_CR4","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1002\/j.1538-7305.1967.tb03174.x","volume":"46","author":"E. R. Berlekamp","year":"1967","journal-title":"Bell Sys. Tech. J."},{"key":"154_CR5","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01386831","volume":"4","author":"H. Niederreiter","year":"1993","journal-title":"AAECC"},{"key":"154_CR6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0024-3795(93)90247-L","volume":"192","author":"H. Niederreiter","year":"1993","journal-title":"Lin. Alg. Appl."},{"key":"154_CR7","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1090\/S0025-5718-1994-1216262-2","volume":"62","author":"H. Niederreiter","year":"1994","journal-title":"Math. Comp."},{"key":"154_CR8","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1006\/jsco.1993.1055","volume":"16","author":"H. Niederreiter","year":"1993","journal-title":"J. Symb. Comp."},{"key":"154_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-1-4615-8675-3_4","volume-title":"Sparse matrices and their applications","author":"F. G. Gustavson","year":"1972"},{"key":"154_CR10","doi-asserted-by":"crossref","first-page":"831","DOI":"10.2307\/2153543","volume":"62","author":"R. G\u00f6ttfert","year":"1994","journal-title":"Math. Comp."},{"key":"154_CR11","volume-title":"Modern Computer algebra","author":"J. von zur Gathen","year":"1999"},{"key":"154_CR12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0024-3795(93)90238-J","volume":"192","author":"P. Fleischmann","year":"1993","journal-title":"Lin. Alg. Appl."},{"key":"154_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01195333","volume":"6","author":"T. C. Y. Lee","year":"1995","journal-title":"AAECC"},{"key":"154_CR14","volume-title":"Direct methods for sparse matrices","author":"I. S. Duff","year":"1986"},{"key":"154_CR15","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1137\/0614059","volume":"14","author":"A. F. Stappen van der","year":"1993","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"154_CR16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","volume":"3","author":"H. M. Markowitz","year":"1957","journal-title":"Management Sci."},{"key":"154_CR17","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1093\/imamat\/8.3.344","volume":"8","author":"A. R. Curtis","year":"1971","journal-title":"J. Inst. Math. Appl."},{"key":"154_CR18","unstructured":"Abu Salem, F.: A BSP parallel model of the G\u00f6ttfert algorithm for polynomial factorization over F2. PPAM 2003, Lecture Notes in Computer Science, vol. 3019, 217\u2013224 (2004)."},{"key":"154_CR19","unstructured":"von zur Gathen, J., Gerhard, J.: Arithmetic and factorization of polynomials over F2. Proc. ISSAC 96. Zurich: ACM Press, pp. 1\u20139."},{"issue":"1","key":"154_CR20","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/504331.504333","volume":"35","author":"O. Bonorden","year":"2001","journal-title":"ACM SIGSAM Bull."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-005-0154-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-005-0154-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-005-0154-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:30:19Z","timestamp":1559140219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-005-0154-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,1,24]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["154"],"URL":"https:\/\/doi.org\/10.1007\/s00607-005-0154-y","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,1,24]]}}}