{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,9]],"date-time":"2024-07-09T19:16:08Z","timestamp":1720552568708},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,10,1]],"date-time":"2000-10-01T00:00:00Z","timestamp":970358400000},"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":4672,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2000,10]]},"DOI":"10.1006\/jcta.1999.3033","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T09:38:25Z","timestamp":1032341905000},"page":"17-28","source":"Crossref","is-referenced-by-count":79,"title":["Finite-Ring Combinatorics and MacWilliams' Equivalence Theorem"],"prefix":"10.1006","volume":"92","author":[{"given":"M.","family":"Greferath","sequence":"first","affiliation":[]},{"given":"S.E.","family":"Schmidt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jcta.1999.3033_RF1","series-title":"Combinatorial Theory","author":"Aigner","year":"1997"},{"key":"10.1006\/jcta.1999.3033_RF2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0019-9958(78)90389-3","article-title":"An elementary proof of the MacWilliams theorem on equivalence of codes","volume":"37","author":"Bogart","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1006\/jcta.1999.3033_RF3","series-title":"Lineare Codes \u00fcber Restklassenringen ganzer Zahlen und ihre Automorphismen bez\u00fcglich einer verallgemeinerten Hamming-Metrik","author":"Constantinescu","year":"1995"},{"key":"10.1006\/jcta.1999.3033_RF4","first-page":"22","article-title":"A metric for codes over residue class rings of integers","volume":"33","author":"Constantinescu","year":"1997","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1006\/jcta.1999.3033_RF5","unstructured":"I. Constantinescu, W. Heise, and T. Honold, Monomial extensions of isometries between codes over Zm, in Proceedings of the 5th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT '96), Unicorn Shumen, 1996, pp. 98\u2013104."},{"key":"10.1006\/jcta.1999.3033_RF6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/18.312154","article-title":"The Z4-linearity of Kerdock, Preparata, Goethals and related codes","volume":"40","author":"Hammons","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1006\/jcta.1999.3033_RF7","unstructured":"W. Heise, T. Honold, and A. A. Nechaev, Weighted modules and representations of codes, in Proceedings of the ACCT 6, Pskov, Russia, 1998, pp. 123\u2013129."},{"key":"10.1006\/jcta.1999.3033_RF8","unstructured":"T. Honold, private communication, 1999."},{"key":"10.1006\/jcta.1999.3033_RF9","series-title":"Combinatorial Properties of Elementary Abelian Groups","author":"MacWilliams","year":"1962"},{"key":"10.1006\/jcta.1999.3033_RF10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1515\/dma.1991.1.4.365","article-title":"Kerdock codes in a cyclic form","volume":"1","author":"Nechaev","year":"1991","journal-title":"Discrete Math. Appl."},{"key":"10.1006\/jcta.1999.3033_RF11","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF00531932","article-title":"On the foundations of combinatorial theory. I. Theory of M\u00f6bius functions","volume":"2","author":"Rota","year":"1964","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"key":"10.1006\/jcta.1999.3033_RF12","series-title":"Enumerative Combinatorics","author":"Stanley","year":"1997"},{"key":"10.1006\/jcta.1999.3033_RF13","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/S0097-3165(96)80011-2","article-title":"Characters and the equivalence of codes","volume":"73","author":"Ward","year":"1996","journal-title":"J. Combin. Theory. Ser. A"},{"key":"10.1006\/jcta.1999.3033_RF14","first-page":"164","article-title":"On the general theory of M\u00f6bius inversion formula and M\u00f6bius product","volume":"20","author":"Wiegandt","year":"1959","journal-title":"Acta Sci. Math. (Szeged)"},{"key":"10.1006\/jcta.1999.3033_RF15","unstructured":"J. A. Wood, Duality for modules over finite rings and applications to coding theory, preprint, 1997."},{"key":"10.1006\/jcta.1999.3033_RF16","series-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","first-page":"329","article-title":"Extension theorems for linear codes over finite rings","author":"Wood","year":"1997"},{"key":"10.1006\/jcta.1999.3033_RF17","doi-asserted-by":"crossref","unstructured":"J. A. Woods, Weight functions and the extension theorem for linear codes over finite rings, preprint, 1997.","DOI":"10.1007\/3-540-63163-1_26"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316599930339?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316599930339?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T07:04:32Z","timestamp":1576479872000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316599930339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,10]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,10]]}},"alternative-id":["S0097316599930339"],"URL":"https:\/\/doi.org\/10.1006\/jcta.1999.3033","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2000,10]]}}}