{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T06:59:05Z","timestamp":1763621945159},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319410081"},{"type":"electronic","value":"9783319410098"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41009-8_67","type":"book-chapter","created":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:49:28Z","timestamp":1465865368000},"page":"618-624","source":"Crossref","is-referenced-by-count":0,"title":["The Construction and Determination of Irreducible Polynomials Over Finite Fields"],"prefix":"10.1007","author":[{"given":"Yun","family":"Song","sequence":"first","affiliation":[]},{"given":"Zhihui","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"issue":"4","key":"67_CR1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ffa.2015.03.005","volume":"35","author":"T Garefalakis","year":"2015","unstructured":"Garefalakis, T., Kapetanakis, G.: A note on the Hansen-Mullen conjecture for self-reciprocal irreducible polynomials. Finite Fields Appl. 35(4), 61\u201363 (2015)","journal-title":"Finite Fields Appl."},{"key":"67_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2014\/263179","volume":"2014","author":"K Magamba","year":"2014","unstructured":"Magamba, K., Ryan, J.A.: Counting irreducible polynomials of degree r over $$ F_{{q^{n} }} $$ and generating Goppa Codes using the lattice of subfields of $$ F_{{q^{nr} }} $$ . J. Discrete Math. 2014, 1\u20134 (2014)","journal-title":"J. Discrete Math."},{"key":"67_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.jnt.2014.12.027","volume":"152","author":"S Ugolini","year":"2015","unstructured":"Ugolini, S.: Sequences of irreducible polynomials over odd prime fields via elliptic curve endomorphisms. J. Number Theor. 152, 21\u201337 (2015)","journal-title":"J. Number Theor."},{"key":"67_CR4","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.ffa.2014.04.003","volume":"29","author":"WH Ri","year":"2014","unstructured":"Ri, W.H., Myong, G.C., Kim, R., et al.: The number of irreducible polynomials over finite fields of characteristic 2 with given trace and subtrace. Finite Fields Appl. 29, 118\u2013131 (2014)","journal-title":"Finite Fields Appl."},{"issue":"10","key":"67_CR5","doi-asserted-by":"crossref","first-page":"6845","DOI":"10.1109\/TIT.2013.2272072","volume":"59","author":"M Kaminski","year":"2013","unstructured":"Kaminski, M., Xing, C.: An upper bound on the complexity of multiplication of polynomials modulo a power of an irreducible polynomial. IEEE Trans. Inf. Theor. 59(10), 6845\u20136850 (2013)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"2","key":"67_CR6","first-page":"1","volume":"65","author":"HA Fan","year":"2016","unstructured":"Fan, H.: A Chinese remainder theorem approach to bit-parallel GF(2n) polynomial basis multipliers for irreducible trinomials. IEEE Trans. Comput.65(2), 1 (2016)","journal-title":"IEEE Trans. Comput."},{"key":"67_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1007\/978-3-662-43948-7_60","volume-title":"Automata, Languages, and Programming","author":"S Kopparty","year":"2014","unstructured":"Kopparty, S., Kumar, M., Saks, M.: Efficient indexing of necklaces and irreducible polynomials over finite fields. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 726\u2013737. Springer, Heidelberg (2014)"},{"issue":"4","key":"67_CR8","first-page":"241","volume":"25","author":"AA Nechae","year":"2015","unstructured":"Nechae, A.A., Popov, V.O.: A generalization of Ore\u2019s theorem on irreducible polynomials over a finite field. Discrete Math. Appl. 25(4), 241\u2013243 (2015)","journal-title":"Discrete Math. Appl."},{"issue":"7","key":"67_CR9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ffa.2013.03.001","volume":"22","author":"P Pollack","year":"2013","unstructured":"Pollack, P.: Irreducible polynomials with several prescribed coefficients. Finite Fields Appl. 22(7), 70\u201378 (2013)","journal-title":"Finite Fields Appl."},{"issue":"3","key":"67_CR10","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/j.ffa.2005.07.002","volume":"12","author":"MK Kyuregyan","year":"2006","unstructured":"Kyuregyan, M.K.: Recurrent methods for constructing irreducible polynomials over F q of odd characteristics. Finite Fields Appl. 12(3), 357\u2013378 (2006)","journal-title":"Finite Fields Appl."},{"issue":"3","key":"67_CR11","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s10623-010-9478-5","volume":"61","author":"MK Kyuregyan","year":"2011","unstructured":"Kyuregyan, M.K., Kyureghyan, G.M.: Irreducible compositions of polynomials over finite fields. Des. Codes Cryptogr. 61(3), 301\u2013314 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"67_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-23568-9_1","volume-title":"Computer Algebra in Scientific Computing","author":"S Abrahamyan","year":"2011","unstructured":"Abrahamyan, S., Kyureghyan, M.: A recurrent method for constructing irreducible polynomials over finite fields. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2011. LNCS, vol. 6885, pp. 1\u20139. Springer, Heidelberg (2011)"},{"issue":"4","key":"67_CR13","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.ffa.2012.03.003","volume":"18","author":"S Abrahamyan","year":"2012","unstructured":"Abrahamyan, S., Alizadeh, M., Kyureghyan, M.K.: Recursive constructions of irreducible polynomials over finite fields. Finite Fields Appl. 18(4), 738\u2013745 (2012)","journal-title":"Finite Fields Appl."},{"key":"67_CR14","volume-title":"Irreducible Polynomial","author":"B Kaliski","year":"2011","unstructured":"Kaliski, B.: Irreducible Polynomial. Springer, New York (2011)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41009-8_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T12:19:28Z","timestamp":1498306768000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41009-8_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319410081","9783319410098"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41009-8_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}