{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T13:18:09Z","timestamp":1778851089306,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00451-1","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"275-292","source":"Crossref","is-referenced-by-count":37,"title":["The average dimension of the hull of cyclic codes"],"prefix":"10.1016","volume":"128","author":[{"given":"Gintaras","family":"Skersys","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00451-1_BIB1","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."},{"key":"10.1016\/S0166-218X(02)00451-1_BIB2","unstructured":"A. Dubickas, F. Holland, G. Skersys, On integers dividing shifted powers and their applications to coding theory, 2002, in preparation."},{"issue":"1","key":"10.1016\/S0166-218X(02)00451-1_BIB3","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/TIT.1969.1054262","article-title":"Quasi-self-reciprocal polynomials and potentially large minimum distance BCH codes","volume":"IT-15","author":"Knee","year":"1969","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/S0166-218X(02)00451-1_BIB4","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","article-title":"Computing automorphism groups of error-correcting codes","volume":"IT-28","author":"Leon","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00451-1_BIB5","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0747-7171(08)80103-4","article-title":"Permutation group algorithms based on partitions, I","volume":"12","author":"Leon","year":"1991","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0166-218X(02)00451-1_BIB6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1090\/dimacs\/028\/10","article-title":"Partitions, refinements, and permutation group computation","volume":"28","author":"Leon","year":"1997","journal-title":"DIMACS, Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00451-1_BIB7","series-title":"Finite Fields","author":"Lidl","year":"1997"},{"key":"10.1016\/S0166-218X(02)00451-1_BIB8","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1978"},{"key":"10.1016\/S0166-218X(02)00451-1_BIB9","first-page":"282","article-title":"On the dimension of the hull","volume":"10","author":"Sendrier","year":"1997","journal-title":"SIAM J. Appl. Math."},{"issue":"4","key":"10.1016\/S0166-218X(02)00451-1_BIB10","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/18.850662","article-title":"Finding the permutation between equivalent codes","volume":"IT-46","author":"Sendrier","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0166-218X(02)00451-1_BIB11","unstructured":"N. Sendrier, G. Skersys, Permutation groups of error-correcting codes, in: D. Augot, C. Carlet (Eds.), Proceedings of Workshop on Coding and Cryptography, INRIA, Paris, 1999, pp. 33\u201341."},{"key":"10.1016\/S0166-218X(02)00451-1_BIB12","doi-asserted-by":"crossref","unstructured":"N. Sendrier, G. Skersys, On the computation of the automorphism group of a linear code, in: Proceedings of IEEE ISIT\u20192001, Washington, DC, 2001, p. 13.","DOI":"10.1109\/ISIT.2001.935876"},{"key":"10.1016\/S0166-218X(02)00451-1_BIB13","unstructured":"G. Skersys, Calcul du groupe d'automorphismes des codes. D\u00e9termination de l\u2019\u00e9quivalence des codes, Ph.D. Thesis, Limoges University, Limoges, 1999."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004511?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02004511?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T11:30:11Z","timestamp":1553686211000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02004511"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02004511"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00451-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}