{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:19:02Z","timestamp":1783106342310,"version":"3.54.6"},"reference-count":31,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001409","name":"Department of Science and Technology, Ministry of Science and Technology, India","doi-asserted-by":"publisher","award":["DST\/INSPIRE\/03\/2023\/000220"],"award-info":[{"award-number":["DST\/INSPIRE\/03\/2023\/000220"]}],"id":[{"id":"10.13039\/501100001409","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005276","name":"National Board for Higher Mathematics","doi-asserted-by":"publisher","award":["0203\/22(16)\/2022\/R"],"award-info":[{"award-number":["0203\/22(16)\/2022\/R"]}],"id":[{"id":"10.13039\/501100005276","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005276","name":"National Board for Higher Mathematics","doi-asserted-by":"publisher","award":["D-II\/11187"],"award-info":[{"award-number":["D-II\/11187"]}],"id":[{"id":"10.13039\/501100005276","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001502","name":"Department of Atomic Energy, Government of India","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001502","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","award":["221610074281"],"award-info":[{"award-number":["221610074281"]}],"id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.disc.2026.115215","type":"journal-article","created":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T02:10:47Z","timestamp":1778811047000},"page":"115215","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the hulls of Z2Z4-additive cyclic codes"],"prefix":"10.1016","volume":"349","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6332-9791","authenticated-orcid":false,"given":"Awadhesh Kumar","family":"Shukla","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sachin","family":"Pathak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Om Prakash","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vipul","family":"Mishra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ashish Kumar","family":"Upadhyay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.disc.2026.115215_br0010","doi-asserted-by":"crossref","first-page":"1508","DOI":"10.1109\/TIT.2014.2299791","article-title":"Z2Z4-additive cyclic codes","volume":"60","author":"Abualrub","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2\u20133","key":"10.1016\/j.disc.2026.115215_br0020","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(90)90003-Z","article-title":"Affine and projective planes","volume":"83","author":"Assmus","year":"1990","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.disc.2026.115215_br0030","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10623-010-9437-1","article-title":"Maximum distance separable codes over Z4 and Z2\u00d7Z4","volume":"61","author":"Bilal","year":"2011","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"10.1016\/j.disc.2026.115215_br0040","doi-asserted-by":"crossref","first-page":"287","DOI":"10.3934\/amc.2012.6.287","article-title":"Characterization and constructions of self-dual codes over Z2\u00d7Z4","volume":"6","author":"Borges","year":"2012","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"10.1016\/j.disc.2026.115215_br0050","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10623-009-9316-9","article-title":"Z2Z4-linear codes: generator matrices and duality","volume":"54","author":"Borges","year":"2010","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"10.1016\/j.disc.2026.115215_br0060","doi-asserted-by":"crossref","first-page":"6348","DOI":"10.1109\/TIT.2016.2611528","article-title":"Z2Z4-additive cyclic codes, generator polynomials, and dual codes","volume":"62","author":"Borges","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115215_br0070","series-title":"Z2Z4-Linear Codes","author":"Borges","year":"2022"},{"key":"10.1016\/j.disc.2026.115215_br0080","series-title":"Principles and Techniques in Combinatorics","author":"Chuan-Chong","year":"1992"},{"issue":"1","key":"10.1016\/j.disc.2026.115215_br0090","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10623-009-9340-9","article-title":"Z2Z4-linear codes: rank and kernel","volume":"56","author":"Fern\u00e1ndez-C\u00f3rdoba","year":"2010","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.disc.2026.115215_br0100","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ffa.2023.102189","article-title":"Hulls of double cyclic codes","volume":"88","author":"Gao","year":"2023","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.disc.2026.115215_br0110","series-title":"Fundamentals of Error-Correcting Codes","author":"Huffman","year":"2003"},{"issue":"3","key":"10.1016\/j.disc.2026.115215_br0120","doi-asserted-by":"crossref","first-page":"451","DOI":"10.3934\/amc.2018027","article-title":"The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order","volume":"12","author":"Jitman","year":"2018","journal-title":"Adv. Math. Commun."},{"key":"10.1016\/j.disc.2026.115215_br0140","first-page":"135","article-title":"Hulls of cyclic codes over the ring F2+vF2","volume":"14","author":"Jitman","year":"2020","journal-title":"Thai J. Math."},{"issue":"1","key":"10.1016\/j.disc.2026.115215_br0150","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2019.111621","article-title":"Hulls of cyclic code over Z4","volume":"343","author":"Jitman","year":"2020","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.disc.2026.115215_br0160","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0097-3165(79)90018-9","article-title":"An algorithm for computing the automorphism group of a Hadamard matrix","volume":"27","author":"Leon","year":"1979","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.disc.2026.115215_br0170","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","article-title":"Computing automorphism groups of error-correcting codes","volume":"3","author":"Leon","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4\u20135","key":"10.1016\/j.disc.2026.115215_br0180","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0747-7171(08)80103-4","article-title":"Permutation group algorithms based on partition, I: theory and algorithms","volume":"12","author":"Leon","year":"1991","journal-title":"J. Symb. Comput."},{"key":"10.1016\/j.disc.2026.115215_br0190","series-title":"Groups and Computation","article-title":"Partitions, refinements, and permutation group computation","author":"Leon","year":"1995"},{"issue":"2","key":"10.1016\/j.disc.2026.115215_br0200","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1109\/TIT.1981.1056328","article-title":"On ternary self-dual codes of length 24","volume":"27","author":"Leon","year":"1981","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"10.1016\/j.disc.2026.115215_br0210","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1109\/18.623157","article-title":"Is code equivalence easy to decide?","volume":"43","author":"Petrank","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.disc.2026.115215_br0220","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/18.556115","article-title":"Translation-invariant propelinear codes","volume":"43","author":"Rif\u00e0","year":"1997","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115215_br0230","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1016\/j.ffa.2014.12.008","article-title":"Hulls of cyclic and negacyclic codes over finite fields","volume":"33","author":"Sangwisut","year":"2015","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.disc.2026.115215_br0240","series-title":"Proceedings of International Symposium on Information Theory","article-title":"Finding the permutation between equivalence binary codes","author":"Sendrier","year":"1997"},{"issue":"2","key":"10.1016\/j.disc.2026.115215_br0250","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1137\/S0895480195294027","article-title":"On the dimension of the hull","volume":"10","author":"Sendrier","year":"1997","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115215_br0260","series-title":"Proceedings of International Symposium on Information Theory","article-title":"On the computation of the automorphism group of a linear code","author":"Sendrier","year":"2001"},{"issue":"5","key":"10.1016\/j.disc.2026.115215_br0270","doi-asserted-by":"crossref","first-page":"3357","DOI":"10.1109\/TIT.2023.3298379","article-title":"Characterization and classification of binary linear codes with various hull dimensions from an improved mass formula","volume":"70","author":"Li","year":"2024","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.disc.2026.115215_br0280","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1109\/TIT.2024.3425058","article-title":"A mass formula for linear codes with prescribed hull dimension and related classification","volume":"71","author":"Li","year":"2025","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115215_br0290","doi-asserted-by":"crossref","first-page":"209","DOI":"10.3934\/amc.2025037","article-title":"Hulls of ZpZp[v]-cyclic codes and construction of EAQECCs","volume":"20","author":"Shukla","year":"2026","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"10.1016\/j.disc.2026.115215_br0300","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0166-218X(02)00451-1","article-title":"The average dimension of the hull of cyclic codes","volume":"128","author":"Skersys","year":"2003","journal-title":"Discrete Appl. Math."},{"issue":"6","key":"10.1016\/j.disc.2026.115215_br0310","doi-asserted-by":"crossref","first-page":"1839","DOI":"10.1109\/18.556679","article-title":"An efficient algorithm for constructing minimal trellises for codes over finite abelian groups","volume":"42","author":"Vazirani","year":"2002","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.disc.2026.115215_br0320","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s00200-020-00474-4","article-title":"On the number of Z2Z4 and ZpZp2-additive cyclic codes","volume":"34","author":"Yildiz","year":"2021","journal-title":"Appl. Algebra Eng. Commun. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002396?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002396?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T18:48:16Z","timestamp":1783104496000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26002396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":31,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0012365X26002396"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115215","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the hulls of -additive cyclic codes","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115215","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115215"}}