{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:52:49Z","timestamp":1776955969571,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,28]],"date-time":"2015-04-28T00:00:00Z","timestamp":1430179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10623-015-0077-3","type":"journal-article","created":{"date-parts":[[2015,4,27]],"date-time":"2015-04-27T07:51:54Z","timestamp":1430121114000},"page":"197-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":68,"title":["Rank-metric codes and their duality theory"],"prefix":"10.1007","volume":"80","author":[{"given":"Alberto","family":"Ravagnani","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,28]]},"reference":[{"key":"77_CR1","doi-asserted-by":"crossref","unstructured":"Bender E.A.: On Buckhiesters enumeration of $$n\\times n$$ n \u00d7 n matrices. J. Comb. Theory Ser. A 17, 273\u2013274 (1974).","DOI":"10.1016\/0097-3165(74)90021-1"},{"key":"77_CR2","doi-asserted-by":"crossref","unstructured":"Buckhiester P.G.: The number of $$n \\times n$$ n \u00d7 n matrices of rank $$r$$ r and trace $$\\alpha $$ \u03b1 over a finite field. Duke Math. J. 39, 695\u2013699 (1972).","DOI":"10.1215\/S0012-7094-72-03974-9"},{"key":"77_CR3","unstructured":"Camion P.: Codes and association schemes. In: Pless V.S., Huffman W.C. (eds.) Handbook of Coding Theory, pp. 1441\u20131566. Elsevier, New York (1998)."},{"key":"77_CR4","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. Philips Res. Rep. 10 (1973)."},{"key":"77_CR5","doi-asserted-by":"crossref","unstructured":"Delsarte P.: Association schemes and $$t$$ t -designs in regular semilattices. J. Comb. Theory Ser. A 20, 230\u2013243 (1976).","DOI":"10.1016\/0097-3165(76)90017-0"},{"key":"77_CR6","doi-asserted-by":"crossref","unstructured":"Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226\u2013241 (1978).","DOI":"10.1016\/0097-3165(78)90015-8"},{"key":"77_CR7","doi-asserted-by":"crossref","unstructured":"Delsarte P., Levenshtein V.: Association schemes and coding theory. IEEE Trans. Inf. Theory 44, 2477\u20132504 (1988).","DOI":"10.1109\/18.720545"},{"key":"77_CR8","doi-asserted-by":"crossref","unstructured":"Dumas J.G., Gow R., McGuire G., Sheekey J.: Subspaces of matrices with special rank properties. Linear Algebra Appl. 433, 191\u2013202 (2010).","DOI":"10.1016\/j.laa.2010.02.015"},{"key":"77_CR9","unstructured":"Gabidulin E.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 1(2), 1\u201312 (1985)."},{"key":"77_CR10","doi-asserted-by":"crossref","unstructured":"Gadouleau M., Yan Z.: MacWilliams Identities for the Rank Metric, pp. 36\u201340. ISIT, France (2007).","DOI":"10.1109\/ISIT.2007.4557200"},{"key":"77_CR11","doi-asserted-by":"crossref","unstructured":"Gadouleau M., Yan Z.: MacWilliams identity for codes with the rank metric. EURASIP J. Wirel. Commun. Netw. (2008). doi: 10.1155\/2008\/754021","DOI":"10.1155\/2008\/754021"},{"key":"77_CR12","unstructured":"Gluesing-Luerssen H.: Fourier-reflexive partitions and MacWilliams identities for additive codes. Des. Codes Cryptogr. (to appear). Preprint available at http:\/\/arxiv.org\/pdf\/1304.1207 ."},{"key":"77_CR13","unstructured":"Grant D., Varanasi M.: Duality theory for space-time codes over finite fields. Adv. Math. Commun. 2(1), 35\u201354 (2005)."},{"key":"77_CR14","unstructured":"Grant D., Varanasi M.: Weight enumerators and a MacWilliams-type identity for space-time rank codes over finite fields. In: Proceedings of the 43rd Annual Allerton Conference on Communication, Control, and Computing, pp. 2137\u20132146 (2005)."},{"key":"77_CR15","doi-asserted-by":"crossref","unstructured":"K\u00f6tter R., Kschischang F.R.: Coding for errors and erasures in random network coding. IEEE Trans. Inf. Theory 54(8), 3579\u20133591 (2008).","DOI":"10.1109\/TIT.2008.926449"},{"key":"77_CR16","doi-asserted-by":"crossref","unstructured":"Li Y., Hu S.: Gauss sums over some matrix groups. J. Number Theory 132(12), 2967\u20132976 (2012).","DOI":"10.1016\/j.jnt.2012.06.010"},{"key":"77_CR17","doi-asserted-by":"crossref","unstructured":"MacWilliams F.J.: A theorem on the distribution of weights in a systematic code. Bell Syst. Tech. J. 42(1), 79\u201394 (1963).","DOI":"10.1002\/j.1538-7305.1963.tb04003.x"},{"key":"77_CR18","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland Mathematical Library (1978)."},{"key":"77_CR19","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Addison-Wesley, Boston (1983)."},{"key":"77_CR20","unstructured":"Jungnickel D., Menezes A.J., Vanston S.A.: The number of self-dual bases of $$GF(q^m)$$ G F ( q m ) over $$GF(q)$$ G F ( q ) . Proc. Am. Math. Soc. 109(1), 23\u201329 (1990)."},{"key":"77_CR21","doi-asserted-by":"crossref","unstructured":"Silva D., Kschishang F.R.: On metrics for error correction in network coding. IEEE Trans. Inf. Theory 55(12), 5479\u20135490 (2009).","DOI":"10.1109\/TIT.2009.2032817"},{"key":"77_CR22","doi-asserted-by":"crossref","unstructured":"Silva D., Kschischang F.R.: Universal secure network coding via rank-metric codes. IEEE Trans. Inf. Theory 57(2), 1124\u20131135 (2011).","DOI":"10.1109\/TIT.2010.2090212"},{"key":"77_CR23","doi-asserted-by":"crossref","unstructured":"Silva D., Rogers E.S., Kschishang F.R., Koetter R.: A rank-metric approach to error control in random network coding. IEEE Trans. Inf. Theory 54(9), 3951\u20133967 (2008).","DOI":"10.1109\/TIT.2008.928291"},{"key":"77_CR24","unstructured":"Stanley P.: Enumerative Combinatorics, vol. 1, 2nd edn., Cambridge Studies in Advanced Mathematics, vol 49. Cambridge University Press, Cambridge (2012)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0077-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0077-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0077-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T04:23:39Z","timestamp":1566620619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0077-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,28]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["77"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0077-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,28]]}}}