{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T21:26:54Z","timestamp":1762032414085},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0012-365x(03)00097-9","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T18:48:19Z","timestamp":1054061299000},"page":"43-65","source":"Crossref","is-referenced-by-count":24,"title":["Type II codes over F2m+uF2m"],"prefix":"10.1016","volume":"275","author":[{"given":"Koichi","family":"Betsumiya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fidel R.","family":"Nemenzo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00097-9_BIB1","unstructured":"K. Betsumiya, The Type II property for self-dual codes over finite fields of characteristic two, preprint, 2001."},{"key":"10.1016\/S0012-365X(03)00097-9_BIB2","doi-asserted-by":"crossref","unstructured":"K. Betsumiya, On the classification of Type II codes over F2r with binary length 32, preprint, 2001.","DOI":"10.1109\/18.945245"},{"key":"10.1016\/S0012-365X(03)00097-9_BIB3","unstructured":"K. Betsumiya, Minimum Lee weights of Type II codes over F2r, in preparation."},{"key":"10.1016\/S0012-365X(03)00097-9_BIB4","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1109\/18.945245","article-title":"On Type II codes over F4","volume":"47","author":"Betsumiya","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00097-9_BIB5","doi-asserted-by":"crossref","unstructured":"K. Betsumiya, M. Harada, A. Munemasa, Type II codes over F2r, in: Proceedings of the 14th AAECC Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Lecture Notes in Computer Science, Vol. 2227, Springer, Berlin, 2001, pp. 102\u2013111.","DOI":"10.1007\/3-540-45624-4_11"},{"key":"10.1016\/S0012-365X(03)00097-9_BIB6","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/18.746770","article-title":"Type II codes over F2+uF2","volume":"45","author":"Dougherty","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00097-9_BIB7","doi-asserted-by":"crossref","first-page":"1222","DOI":"10.1109\/18.508845","article-title":"Mass formulas for self-dual codes over Z4 and Fq+uFq rings","volume":"42","author":"Gaborit","year":"1996","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/S0012-365X(03)00097-9_BIB8","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1006\/ffta.2001.0333","article-title":"Type II codes over F4","volume":"8","author":"Gaborit","year":"2002","journal-title":"Finite Fields Appl."},{"key":"10.1016\/S0012-365X(03)00097-9_BIB9","series-title":"Finite Fields: Structure and Arithmetics","author":"Jungnickel","year":"1993"},{"key":"10.1016\/S0012-365X(03)00097-9_BIB10","unstructured":"R. Lidl, H. Niederreiter, Finite fields, in: G.C. Rota (Ed.), Encyclopedia of Mathematics and its Applications, Vol. 20, Cambridge University Press, Cambridge, 1997."},{"issue":"7","key":"10.1016\/S0012-365X(03)00097-9_BIB11","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1006\/eujc.2001.0509","article-title":"Type II codes over F4+uF4","volume":"12","author":"Ling","year":"2001","journal-title":"European J. Combin."},{"key":"10.1016\/S0012-365X(03)00097-9_BIB12","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0012-365X(03)00097-9_BIB13","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/S0019-9958(73)90273-8","article-title":"An upper bound for self-dual codes","volume":"22","author":"Mallows","year":"1973","journal-title":"Inform. Control"},{"key":"10.1016\/S0012-365X(03)00097-9_BIB14","series-title":"Handbook of Coding Theory","article-title":"Self-dual codes","author":"Rains","year":"1998"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000979?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03000979?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T04:50:18Z","timestamp":1553143818000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03000979"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0012365X03000979"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00097-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}