{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T21:53:51Z","timestamp":1776462831153,"version":"3.51.2"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T00:00:00Z","timestamp":1672272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T00:00:00Z","timestamp":1672272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001381","name":"National Research Foundation Singapore","doi-asserted-by":"publisher","award":["NRF-RF2009-07"],"award-info":[{"award-number":["NRF-RF2009-07"]}],"id":[{"id":"10.13039\/501100001381","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10623-022-01181-6","type":"journal-article","created":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T17:05:17Z","timestamp":1672333517000},"page":"1627-1644","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rank weight hierarchy of some classes of polynomial codes"],"prefix":"10.1007","volume":"91","author":[{"given":"J\u00e9r\u00f4me","family":"Ducoat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3141-3118","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9rique","family":"Oggier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,29]]},"reference":[{"issue":"4","key":"1181_CR1","doi-asserted-by":"publisher","first-page":"575","DOI":"10.3934\/amc.2020083","volume":"15","author":"G Berhuy","year":"2021","unstructured":"Berhuy G., Fasel J., Garotta O.: Rank weights for arbitrary finite field extensions. Adv. Math. Commun. 15(4), 575\u2013587 (2021).","journal-title":"Adv. Math. Commun."},{"key":"1181_CR2","unstructured":"Ducoat J.: Generalized rank weights: a duality statement. Finite Fields and Applications (Fq11). http:\/\/arxiv.org\/abs\/1306.3899 (2013)."},{"key":"1181_CR3","volume-title":"\u201cRank weight hierarchy of some classes of cyclic codes\u201d, IEEE Information Theory Workshop (ITW 2014)","author":"J Ducoat","year":"2014","unstructured":"Ducoat J., Oggier F.: \u201cRank weight hierarchy of some classes of cyclic codes\u2019\u2019, IEEE Information Theory Workshop (ITW 2014). Hobbart, Australia (2014)."},{"key":"1181_CR4","first-page":"1","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximal rank distance. Probl. Inf. Transm. 21, 1\u201312 (1985).","journal-title":"Probl. Inf. Transm."},{"issue":"12","key":"1181_CR5","doi-asserted-by":"publisher","first-page":"2531","DOI":"10.1007\/s10623-020-00798-9","volume":"88","author":"S Ghorpade","year":"2020","unstructured":"Ghorpade S., Johnsen T.: A polymatroid approach to generalized weights of rank metric codes. Des. Codes Cryptogr. 88(12), 2531\u20132546 (2020).","journal-title":"Des. Codes Cryptogr."},{"key":"1181_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error Correcting Codes. Cambridge University Press, Cambridge (2003)."},{"issue":"1","key":"1181_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.3934\/amc.2017014","volume":"11","author":"R Jurrius","year":"2017","unstructured":"Jurrius R., Pellikaan R.: On defining generalized rank weights. Adv. Math. Commun. 11(1), 225\u2013235 (2017).","journal-title":"Adv. Math. Commun."},{"key":"1181_CR8","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1109\/TIT.2015.2429713","volume":"61","author":"J Kurihara","year":"2015","unstructured":"Kurihara J., Matsumoto R., Uyematsu T.: Relative generalized rank weight of linear codes and its applications to network coding. IEEE Trans. Inf. Theory 61, 7 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1181_CR9","volume-title":"Finite Fields. Encyclopedia of Mathematics and its Applications","author":"R Lidl","year":"2008","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and its Applications, 2nd edn Cambridge University Press, Cambridge (2008).","edition":"2"},{"key":"1181_CR10","unstructured":"Oggier F., Sboui A.: On the existence of generalized rank weights. In: International Symposium on Information Theory and Its Applications (ISITA 2012), Honolulu (2012)."},{"issue":"2","key":"1181_CR11","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/18.75248","volume":"37","author":"RM Roth","year":"1991","unstructured":"Roth R.M.: Maximum-rank array codes and their application to crisscross error correction. IEEE Trans. Inf. Theory 37(2), 328\u2013336 (1991).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1181_CR12","unstructured":"SageMath: The Sage mathematics software system (version 8.1), The Sage Developers. http:\/\/www.sagemath.org (2018)."},{"issue":"8","key":"1181_CR13","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1007\/s10623-018-0576-0","volume":"87","author":"K Shiromoto","year":"2019","unstructured":"Shiromoto K.: Codes with the rank metric and matroids. Des. Codes Cryptogr. 87(8), 1765\u20131776 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1181_CR14","doi-asserted-by":"crossref","unstructured":"Sripati U., Sundar Rajan B.: On the rank-distance of cyclic codes. In: IEEE International Symposium on Information Theory (ISIT 2003), Yokohama (2003).","DOI":"10.1109\/ISIT.2003.1228086"},{"key":"1181_CR15","doi-asserted-by":"crossref","unstructured":"Sripati U., Sundar Rajan B.: On the rank-distance of cyclic codes. Technical Report TR-PME-2003-04 (2022).","DOI":"10.1109\/ISIT.2003.1228086"},{"issue":"1","key":"1181_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/18.50376","volume":"36","author":"H Stichtenoth","year":"1990","unstructured":"Stichtenoth H.: On the dimension of subfield subcodes. IEEE Trans. Inf. Theory 36(1), 1\u201310 (1990).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01181-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01181-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01181-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T20:07:07Z","timestamp":1682021227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01181-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,29]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1181"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01181-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,29]]},"assertion":[{"value":"28 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}