{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:46:12Z","timestamp":1742975172807,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-74180-2_10","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"118-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Determining Minimal Degree Polynomials of a Cyclic Code of Length $$2^k$$ over $$\\mathbb {Z}_8$$"],"prefix":"10.1007","author":[{"given":"Arpana","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sucheta","family":"Dutt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"issue":"9","key":"10_CR1","doi-asserted-by":"publisher","first-page":"2126","DOI":"10.1109\/TIT.2003.815763","volume":"49","author":"T Abualrub","year":"2003","unstructured":"Abualrub, T., Oehmke, R.: On generators of $$\\mathbb{Z}_4$$ cyclic codes of length $$2^e$$. IEEE Trans. Inf. Theor. 49(9), 2126\u20132133 (2003)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"12","key":"10_CR2","doi-asserted-by":"publisher","first-page":"3306","DOI":"10.1109\/TIT.2004.838109","volume":"50","author":"T Abualrub","year":"2004","unstructured":"Abualrub, T., Ghrayeb, A., Oehmke, R.: A mass formula and rank of $$\\mathbb{Z}_4$$ cyclic codes of length $$2^e$$. IEEE Trans. Inf. Theor. 50(12), 3306\u20133312 (2004)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ffa.2007.07.001","volume":"14","author":"HQ Dinh","year":"2008","unstructured":"Dinh, H.Q.: On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions. Finite Fields Appl. 14(1), 22\u201340 (2008)","journal-title":"Finite Fields Appl."},{"issue":"8","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1728","DOI":"10.1109\/TIT.2004.831789","volume":"50","author":"HQ Dinh","year":"2004","unstructured":"Dinh, H.Q., Lopez Permouth, S.R.: Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inf. Theor. 50(8), 1728\u20131744 (2004)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ffa.2005.06.004","volume":"13","author":"ST Dougherty","year":"2007","unstructured":"Dougherty, S.T., Park, Y.H.: On modular cyclic codes. Finite Fields Appl. 13, 31\u201357 (2007)","journal-title":"Finite Fields Appl."},{"key":"10_CR6","first-page":"104","volume":"2","author":"A Garg","year":"2012","unstructured":"Garg, A., Dutt, S.: Cyclic codes of length $$2^k$$ over $$\\mathbb{Z}_8$$. Sci. Res. Open J. Appl. Sci. 2, 104\u2013107 (2012). October - 2012 World Congress on Engineering and Technology","journal-title":"Sci. Res. Open J. Appl. Sci."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-319-53007-9_16","volume-title":"Algorithms and Discrete Applied Mathematics","author":"A Garg","year":"2017","unstructured":"Garg, A., Dutt, S.: On rank and MDR cyclic codes of length $$2^k$$ Over $$Z_8$$. In: Gaur, D., Narayanaswamy, N.S. (eds.) CALDAM 2017. LNCS, vol. 10156, pp. 177\u2013186. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53007-9_16"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"834","DOI":"10.1016\/j.ffa.2008.02.003","volume":"14","author":"HM Kiah","year":"2008","unstructured":"Kiah, H.M., Leung, K.H., Ling, S.: Cyclic codes over $$GR(p^2, m)$$ of length $$p^k$$. Finite Fields Appl. 14, 834\u2013846 (2008)","journal-title":"Finite Fields Appl."},{"issue":"5","key":"10_CR9","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1007\/s11767-007-0071-7","volume":"25","author":"S Minjia","year":"2008","unstructured":"Minjia, S., Shixin, Z.: Cyclic codes over the ring $$Z_{p^2}$$ of length $$p^e$$. J. Electron. (China) 25(5), 636\u2013640 (2008)","journal-title":"J. Electron. (China)"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.dam.2005.03.016","volume":"154","author":"A Salagean","year":"2006","unstructured":"Salagean, A.: Repeated-root cyclic and negacyclic codes over a finite chain ring. Discrete Appl. Math. 154(2), 413\u2013419 (2006)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74180-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:51:02Z","timestamp":1709826662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}