{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T05:02:55Z","timestamp":1718946175341},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s00200-011-0140-x","type":"journal-article","created":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T22:20:09Z","timestamp":1301091609000},"page":"113-135","source":"Crossref","is-referenced-by-count":9,"title":["Higher weights for codes over rings"],"prefix":"10.1007","volume":"22","author":[{"given":"Steven T.","family":"Dougherty","sequence":"first","affiliation":[]},{"given":"Sunghyu","family":"Han","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,26]]},"reference":[{"key":"140_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01390768","volume":"6","author":"A.R. Calderbank","year":"1995","unstructured":"Calderbank A.R., Sloane N.J.A.: Modular and p-adic cyclic codes. Des. Codes Cryptogr. 6, 21\u201335 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"140_CR2","volume-title":"An Introduction to Magma","author":"J. Cannon","year":"1994","unstructured":"Cannon J., Playoust C.: An Introduction to Magma. University of Sydney, Sydney (1994)"},{"key":"140_CR3","first-page":"231","volume":"31","author":"S.T. Dougherty","year":"2005","unstructured":"Dougherty S.T., Gupta M., Shiromoto K.: On generalized weights for codes over $${\\mathbb{Z}_k}$$ . Aust. J. Combinat. 31, 231\u2013248 (2005)","journal-title":"Aust. J. Combinat."},{"key":"140_CR4","unstructured":"Dougherty, S.T., Han, S.: Higher weights and generalized MDS codes. J. Korean Math. Soc. (to appear)"},{"key":"140_CR5","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/PL00004225","volume":"11","author":"S.T. Dougherty","year":"2001","unstructured":"Dougherty S.T., Harada M., Oura M.: Note on the g-fold joint weight enumerators of self-dual codes over $${\\mathbb{Z}_k}$$ . AAECC 11, 437\u2013445 (2001)","journal-title":"AAECC"},{"key":"140_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10623-008-9215-5","volume":"50","author":"S.T. Dougherty","year":"2008","unstructured":"Dougherty S.T., Kim J.-L., Kulosman H.: MDS codes over finite principal ideal rings. Des. Codes Cryptogr. 50, 77\u201392 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"140_CR7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.disc.2005.08.004","volume":"305","author":"S.T. Dougherty","year":"2005","unstructured":"Dougherty S.T., Kim S.Y., Park Y.H.: Lifted codes and their weight enumerators. Discr. Math. 305, 123\u2013135 (2005)","journal-title":"Discr. Math."},{"key":"140_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10623-008-9243-1","volume":"51","author":"S.T. Dougherty","year":"2009","unstructured":"Dougherty S.T., Liu H.: Independence of vectors in codes over rings. Des. Codes Cryptogr. 51, 55\u201368 (2009)","journal-title":"Des. Codes Cryptogr."},{"key":"140_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1109\/18.817524","volume":"46","author":"S.T. Dougherty","year":"2000","unstructured":"Dougherty S.T., Shiromoto K.: MDR codes over $${\\mathbb{Z}_k}$$ . IEEE Trans. Inform. Theory 46, 265\u2013269 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"140_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-45624-4_15","volume":"2227","author":"H. Horimoto","year":"2001","unstructured":"Horimoto H., Shiromoto K.: On generalized Hamming weights for codes over finite chain rings. Lect. Notes Comput. Sci. 2227, 141\u2013150 (2001)","journal-title":"Lect. Notes Comput. Sci."},{"key":"140_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-correcting Codes","author":"W.C. Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.S.: Fundamentals of Error-correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"140_CR12","doi-asserted-by":"crossref","first-page":"1060","DOI":"10.1109\/18.841186","volume":"46","author":"G.H. Norton","year":"2000","unstructured":"Norton G.H., S\u0103l\u0103gean A.: On the Hamming distance of linear codes over a finite chain ring. IEEE Trans. Inform. Theory 46, 1060\u20131067 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"140_CR13","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1109\/18.476213","volume":"41","author":"M.A. Tsfasman","year":"1995","unstructured":"Tsfasman M.A., Vladut S.G.: Geometric approach to higher weights. IEEE Trans. Inform. Theory 41, 1564\u20131588 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"140_CR14","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1109\/18.133259","volume":"37","author":"V.K. Wei","year":"1991","unstructured":"Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inform. Theory 37, 1412\u20131418 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"140_CR15","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1353\/ajm.1999.0024","volume":"121","author":"J. Wood","year":"1999","unstructured":"Wood J.: Duality for modules over finite rings and applications to coding theory. Am. J. Math. 121, 555\u2013575 (1999)","journal-title":"Am. J. Math."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-011-0140-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-011-0140-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-011-0140-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:24:22Z","timestamp":1558625062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-011-0140-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s00200-011-0140-x","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}