{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T00:42:04Z","timestamp":1774053724371,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,25]],"date-time":"2011-06-25T00:00:00Z","timestamp":1308960000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10623-011-9537-6","type":"journal-article","created":{"date-parts":[[2011,6,24]],"date-time":"2011-06-24T03:59:44Z","timestamp":1308887984000},"page":"87-104","source":"Crossref","is-referenced-by-count":19,"title":["On explicit factors of cyclotomic polynomials over finite fields"],"prefix":"10.1007","volume":"63","author":[{"given":"Liping","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,25]]},"reference":[{"key":"9537_CR1","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TIT.1982.1056591","volume":"28","author":"E.R. Berlekamp","year":"1982","unstructured":"Berlekamp E.R.: Bit-serial Reed-Solomon encoders. IEEE Trans. Inform. Theory 28, 869\u2013874 (1982)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9537_CR2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.2307\/2318309","volume":"84","author":"F.R. Beyl","year":"1977","unstructured":"Beyl F.R.: Cyclic subgroups of the prime residue group. Am. Math. Mon. 84, 46\u201348 (1977)","journal-title":"Am. Math. Mon."},{"key":"9537_CR3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.ffa.2005.05.002","volume":"11","author":"S.D. Cohen","year":"2005","unstructured":"Cohen S.D.: Explicit theorems on generator polynomials. Finite Fields Appl. 11, 337\u2013357 (2005)","journal-title":"Finite Fields Appl."},{"key":"9537_CR4","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.ffa.2004.12.002","volume":"11","author":"R.W. Fitzgerald","year":"2005","unstructured":"Fitzgerald R.W., Yucas J.L.: Factors of Dickson polynomials over finite fields. Finite Fields Appl. 11, 724\u2013737 (2005)","journal-title":"Finite Fields Appl."},{"key":"9537_CR5","unstructured":"Fitzgerald R.W., Yucas J.L.: Explicit factorization of cyclotomic and Dickson polynomials over finite fields. In: Arithmetic of Finite Fields. Lecture Notes in Computer Science, vol. 4547, pp. 1\u201310. Springer, Berlin (2007)."},{"key":"9537_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1090\/conm\/225\/03208","volume":"225","author":"S. Gao","year":"1999","unstructured":"Gao S., Howell J., Panario D.: Irreducible polynomials of given forms. Contemp. Math. 225, 43\u201354 (1999)","journal-title":"Contemp. Math."},{"key":"9537_CR7","doi-asserted-by":"crossref","unstructured":"Golomb, S. Gong, G.: Signal Design for Good Correlation: For Wireless Communication. Cryptography, and Radar, Cambridge University Press (2005).","DOI":"10.1017\/CBO9780511546907"},{"key":"9537_CR8","unstructured":"Lidl R., Niederreiter H.: Finite Fields (Encyclopedia of Mathematics and Its Application), vol. 20, 2nd edn. Cambridge University Press, Cambridge (1997)."},{"key":"9537_CR9","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1006\/ffta.1996.0026","volume":"2","author":"H. Meyn","year":"1996","unstructured":"Meyn H.: Factorization of the cyclotomic polynomials $${x^{2^n} +1}$$ over finite fields. Finite Fields Appl. 2, 439\u2013442 (1996)","journal-title":"Finite Fields Appl."},{"key":"9537_CR10","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/12.35840","volume":"38","author":"M. Wang","year":"1989","unstructured":"Wang M., Blake I.F.: Bit-serial multiplication in finite fields. IEEE Trans. Comput. 38, 1457\u20131460 (1989)","journal-title":"IEEE Trans. Comput."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9537-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9537-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9537-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T01:41:45Z","timestamp":1560303705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9537-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,25]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9537"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9537-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,25]]}}}