{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:07Z","timestamp":1772283607701,"version":"3.50.1"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,7,9]],"date-time":"2011-07-09T00:00:00Z","timestamp":1310169600000},"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-9538-5","type":"journal-article","created":{"date-parts":[[2011,7,8]],"date-time":"2011-07-08T13:58:48Z","timestamp":1310133528000},"page":"105-112","source":"Crossref","is-referenced-by-count":24,"title":["A note on cyclic codes over GR(p 2, m) of length p k"],"prefix":"10.1007","volume":"63","author":[{"given":"Han Mao","family":"Kiah","sequence":"first","affiliation":[]},{"given":"Ka Hin","family":"Leung","sequence":"additional","affiliation":[]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,9]]},"reference":[{"issue":"9","key":"9538_CR1","doi-asserted-by":"crossref","first-page":"2126","DOI":"10.1109\/TIT.2003.815763","volume":"49","author":"T. Abualrub","year":"2003","unstructured":"Abualrub T., Oehmke R.: On the generators of $${\\mathbb {Z}_{4}}$$ cyclic codes of length 2 e . IEEE. Trans. Inform. Theory. 49(9), 2126\u20132133 (2003)","journal-title":"IEEE. Trans. Inform. Theory."},{"key":"9538_CR2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0166-218X(02)00434-1","volume":"128","author":"T. Blackford","year":"2003","unstructured":"Blackford T.: Cyclic codes over $${\\mathbb {Z}_{4}}$$ of oddly even length. Discret. Appl. Math. 128, 27\u201346 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"9538_CR3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10623-005-2773-x","volume":"39","author":"S.T. Dougherty","year":"2006","unstructured":"Dougherty S.T., Ling S.: Cyclic codes over $${\\mathbb {Z}_{4}}$$ of even length. Des. Code. Cryptogr. 39(2), 127\u2013153 (2006)","journal-title":"Des. Code. Cryptogr."},{"key":"9538_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.ffa.2005.06.004","volume":"13","author":"S.T. 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":"9538_CR5","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"A.R. Hammons","year":"1994","unstructured":"Hammons A.R., Kumar P.V., Calderbank A.R., Sloane N.J.A., Sol\u00e9 P.: The $${\\mathbb {Z}_{4}}$$ linearity of Kerdock, Preparata, Goethals, and related codes. IEEE. Trans. Inform. Theory. 40, 301\u2013319 (1994)","journal-title":"IEEE. Trans. Inform. Theory."},{"key":"9538_CR6","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1016\/j.ffa.2008.02.003","volume":"14","author":"H.M. 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."},{"key":"9538_CR7","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.ffa.2009.01.004","volume":"15","author":"R. Sobhani","year":"2009","unstructured":"Sobhani R., Esmaeili M.: A note on cyclic codes over GR(p 2,m) of length p k . Finite Fields Appl. 15, 387\u2013391 (2009)","journal-title":"Finite Fields Appl."},{"key":"9538_CR8","unstructured":"Weisstein E.W.: Genocchi number. From MathWorld\u2013A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/GenocchiNumber.html . Accessed 15 Jul 2009."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9538-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-011-9538-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-011-9538-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:30Z","timestamp":1559231910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-011-9538-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,9]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9538"],"URL":"https:\/\/doi.org\/10.1007\/s10623-011-9538-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,9]]}}}