{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T00:17:01Z","timestamp":1776730621308,"version":"3.51.2"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0735099"],"award-info":[{"award-number":["DMS-0735099"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0903517"],"award-info":[{"award-number":["DMS-0903517"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-0838463"],"award-info":[{"award-number":["DMS-0838463"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000138","name":"U.S. Department of Education","doi-asserted-by":"publisher","award":["P200A090002"],"award-info":[{"award-number":["P200A090002"]}],"id":[{"id":"10.13039\/100000138","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/tit.2014.2359198","type":"journal-article","created":{"date-parts":[[2014,9,19]],"date-time":"2014-09-19T15:06:49Z","timestamp":1411139209000},"page":"7035-7046","source":"Crossref","is-referenced-by-count":46,"title":["Equivalence for Rank-Metric and Matrix Codes and Automorphism Groups of Gabidulin Codes"],"prefix":"10.1109","volume":"60","author":[{"given":"Katherine","family":"Morrison","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","article-title":"Codes and groups","author":"huffman","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926449"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"ref14","article-title":"Combinatorial problems of elementary group theory","author":"macwilliams","year":"1962"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1959-008-0"},{"key":"ref16","article-title":"Equivalence and duality for rank-metric and matrix codes","author":"morrison","year":"2012"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9003-9"},{"key":"ref18","article-title":"Self-dual codes","author":"rains","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928291"},{"key":"ref4","article-title":"Array codes","author":"blaum","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819322"},{"key":"ref6","first-page":"1","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"gabidulin","year":"1985","journal-title":"Problems Inf Transmission"},{"key":"ref5","article-title":"Practical network coding","author":"chou","year":"2003","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3934\/amc.2008.2.35","article-title":"Duality theory for space-time codes over finite fields","volume":"2","author":"grant","year":"2008","journal-title":"Adv Math Commun"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-007-9160-8"},{"key":"ref2","article-title":"MacWilliams extension theorems and the local-global property for codes over rings","author":"barra","year":"2013"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6926896\/06905853.pdf?arnumber=6905853","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:51:16Z","timestamp":1641988276000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6905853\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":19,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2359198","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}