{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:04:24Z","timestamp":1746295464037},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540545224"},{"type":"electronic","value":"9783540384366"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54522-0_123","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:58:51Z","timestamp":1330210731000},"page":"352-359","source":"Crossref","is-referenced-by-count":4,"title":["Improving the time complexity of the computation of irreducible and primitive polynomials in finite fields"],"prefix":"10.1007","author":[{"given":"Josep","family":"Rif\u00e0","sequence":"first","affiliation":[]},{"given":"Joan","family":"Borrell","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"IT-28","author":"E.R. Berlekamp","year":"1982","unstructured":"E.R. Berlekamp, \u201cBit-Serial Reed-Solomon Encoders\u201d, IEEE Trans. on Information Theory, Vol. IT-28, pp. 869\u2013874, Nov. 1982.","journal-title":"IEEE Trans. on Information Theory"},{"key":"33_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-2174-1","volume-title":"Error-Correcting Coding for Digital Communications","author":"G.C. Clark","year":"1981","unstructured":"G.C. Clark, J.B. Cain, Error-Correcting Coding for Digital Communications, Plenum Press, New York, 1981."},{"key":"33_CR3","volume-title":"Secondo Simposio su Stato e Prospettive della Ricerca Crittografica in Italia (SPRCI'89)","author":"A. Porto Di","year":"1989","unstructured":"A. Di Porto, F. Guida, E. Montolivo, \u201cMetodi di ricerca di polinomi irriducibili e di polinomi primitivi con coefficienti in campi finiti\u201d in Secondo Simposio su Stato e Prospettive della Ricerca Crittografica in Italia (SPRCI'89), Fondazione Ugo Bordoni, Roma, 1989."},{"key":"33_CR4","volume-title":"Introduction to finite fields and their applications","author":"R. Lidl","year":"1986","unstructured":"R. Lidl, H. Niederreiter, Introduction to finite fields and their applications, Cambridge University Press, Cambridge, 1986."},{"key":"33_CR5","volume-title":"The theory of Error Correcting Codes","author":"P.J. MacWilliams","year":"1983","unstructured":"P.J. MacWilliams, N.J.A. Sloane, The theory of Error Correcting Codes, North-Holland Publishing Company, Amsterdam, 1983."},{"key":"33_CR6","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"IT-15","author":"J.L. Massey","year":"1969","unstructured":"J.L. Massey, \u201cShift-Register Synthesis and BCH Decoding\u201d, IEEE Trans. on Information Theory, Vol. IT-15, pp. 122\u2013127, Jan. 1969.","journal-title":"IEEE Trans. on Information Theory"},{"key":"33_CR7","unstructured":"J.L. Massey, J.K. Omura, \u201cComputational method and apparatus for finite field arithmetic\u201d, U.S. Patent Application, 1981."},{"key":"33_CR8","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1109\/18.45274","volume":"IT-35","author":"M. Morii","year":"1989","unstructured":"M. Morii, M. Kasahara, D.L. Whiting, \u201cEfficient Bit-Serial Multiplication and the Discrete-Time Wiener-Hopf Equation Over Finite Fields\u201d, IEEE Trans. on Information Theory, Vol. IT-35, pp. 1177\u20131183, Nov. 1989.","journal-title":"IEEE Trans. on Information Theory"},{"key":"33_CR9","unstructured":"M.J. Quinn, Designing efficient algorithms for parallel computers, McGraw-Hill Book Company, 1987."},{"key":"33_CR10","volume-title":"Lecture Notes in Computer Science 388","author":"J.A. Thiong Ly","year":"1989","unstructured":"J.A. Thiong Ly, \u201cNote for computing the minimum polynomial of elements in large finite fields\u201d in Lecture Notes in Computer Science 388, Springer-Verlag, Berlin, 1989."},{"key":"33_CR11","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/TC.1985.1676616","volume":"C-34","author":"C.C. Wang","year":"1985","unstructured":"C.C. Wang, T.K. Truong, H.M. Shao, L.J. Deutsch, J.K. Omura, I.S. Reed, \u201cVLSI Architectures for Computing Multiplications and Inverses in GF(2m)\u201d, IEEE Trans. on Computers, Vol. C-34, pp. 709\u2013717, Aug. 1985.","journal-title":"IEEE Trans. on Computers"},{"key":"33_CR12","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1109\/TC.1984.1676441","volume":"C-33","author":"C.-S. Yeh","year":"1984","unstructured":"C.-S. Yeh, I.S. Reed, T.K. Truong, \u201cSystolic Multipliers for Finite Fields GF(2m)\u201d, IEEE Trans. on Computers, Vol. C-33, pp. 357\u2013360, Apr. 1984.","journal-title":"IEEE Trans. on Computers"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54522-0_123.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:47Z","timestamp":1619572967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54522-0_123"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540545224","9783540384366"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-54522-0_123","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}