{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:57:02Z","timestamp":1772283422510,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T00:00:00Z","timestamp":1470009600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004836","name":"Det Frie Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["DFF-4002-00367"],"award-info":[{"award-number":["DFF-4002-00367"]}],"id":[{"id":"10.13039\/501100004836","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":[[2017,6]]},"DOI":"10.1007\/s10623-016-0262-z","type":"journal-article","created":{"date-parts":[[2016,8,1]],"date-time":"2016-08-01T01:30:19Z","timestamp":1470015019000},"page":"639-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["On the roots and minimum rank distance of skew cyclic codes"],"prefix":"10.1007","volume":"83","author":[{"given":"Umberto","family":"Mart\u00ednez-Pe\u00f1as","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,1]]},"reference":[{"key":"262_CR1","doi-asserted-by":"crossref","unstructured":"Boucher D., Ulmer F.: Coding with skew polynomial rings. J. Symb. Comput. 44(12), 1644\u20131656 (2009) (Gr\u00f6bner Bases in Cryptography, Coding Theory, and Algebraic Combinatorics).","DOI":"10.1016\/j.jsc.2007.11.008"},{"key":"262_CR2","doi-asserted-by":"crossref","unstructured":"Boucher D., Geiselmann W., Ulmer F.: Skew-cyclic codes. Appl. Algebr. Eng. Commun. Comput. 18(4), 379\u2013389 (2007).","DOI":"10.1007\/s00200-007-0043-z"},{"key":"262_CR3","doi-asserted-by":"crossref","unstructured":"Chaussade L., Loidreau P., Ulmer F.: Skew codes of prescribed distance or rank. Des. Codes Cryptogr. 50(3), 267\u2013284 (2009).","DOI":"10.1007\/s10623-008-9230-6"},{"key":"262_CR4","doi-asserted-by":"crossref","unstructured":"Delsarte P.: On subfield subcodes of modified reed-solomon codes (corresp.). IEEE Trans. Inf. Theory 21(5), 575\u2013576 (2006).","DOI":"10.1109\/TIT.1975.1055435"},{"key":"262_CR5","doi-asserted-by":"crossref","unstructured":"Ducoat J., Oggier F.: Rank weight hierarchy of some classes of cyclic codes. In: Information Theory Workshop (ITW), 2014 IEEE, pp. 142\u2013146 (2014).","DOI":"10.1109\/ITW.2014.6970809"},{"key":"262_CR6","doi-asserted-by":"crossref","unstructured":"Duursma I.M., Pellikaan R.: A symmetric Roos bound for linear codes. J. Comb. Theory, Ser. A 113(8), 1677\u20131688 (2006) (Special Issue in Honor of Jacobus H. van Lint).","DOI":"10.1016\/j.jcta.2006.03.020"},{"key":"262_CR7","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Probl. Inf. Transm. 21(1), 3\u201316 (1985)."},{"key":"262_CR8","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M.: Rank q-cyclic and pseudo-q-cyclic codes. In: IEEE International Symposium on Information Theory ISIT 2009, pp. 2799\u20132802 (2009).","DOI":"10.1109\/ISIT.2009.5205787"},{"key":"262_CR9","doi-asserted-by":"crossref","unstructured":"Gursoy F., Siap I., Yildiz B.: Construction of skew cyclic codes over $${\\mathbb{F}}_q+v{\\mathbb{F}}_q$$ F q + v F q . Adv. Math. Commun. 8(3), 313\u2013322 (2014).","DOI":"10.3934\/amc.2014.8.313"},{"key":"262_CR10","doi-asserted-by":"crossref","unstructured":"Hartmann C.R.P., Tzeng K.K.: Generalizations of the BCH bound. Inf. Control 20(5), 489\u2013498 (1972).","DOI":"10.1016\/S0019-9958(72)90887-X"},{"key":"262_CR11","doi-asserted-by":"crossref","unstructured":"Huffman W.C., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003).","DOI":"10.1017\/CBO9780511807077"},{"key":"262_CR12","doi-asserted-by":"crossref","unstructured":"Kshevetskiy, A., Gabidulin, E.M.: The new construction of rank codes. In: Proceedings of the International Symposium on Information Theory ISIT 2005, pp. 2105\u20132108 (2005).","DOI":"10.1109\/ISIT.2005.1523717"},{"key":"262_CR13","unstructured":"Lidl, R., Niederreiter, H.: Finite Fields, vol.\u00a020. Encyclopedia of Mathematics and Its Applications. Addison-Wesley, Amsterdam (1983)."},{"issue":"7","key":"262_CR14","doi-asserted-by":"crossref","first-page":"4081","DOI":"10.1109\/TIT.2016.2570238","volume":"62","author":"U Mart\u00ednez-Pe\u00f1as","year":"2016","unstructured":"Mart\u00ednez-Pe\u00f1as U.: On the similarities between generalized rank and Hamming weights and their applications to network coding. IEEE Trans. Inf. Theory 62(7), 4081\u20134095 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"262_CR15","doi-asserted-by":"crossref","unstructured":"Ore O.: On a special class of polynomials. Trans. Am. Math. Soc. 35(3), 559\u2013584 (1933).","DOI":"10.1090\/S0002-9947-1933-1501703-0"},{"key":"262_CR16","doi-asserted-by":"crossref","unstructured":"Ore O.: Theory of non-commutative polynomials. Ann. Math. 34(3), 480\u2013508 (1933).","DOI":"10.2307\/1968173"},{"key":"262_CR17","doi-asserted-by":"crossref","unstructured":"Pellikaan, R.: The shift bound for cyclic, Reed-Muller and geometric Goppa codes. In: Arithmetic, Geometry and Coding Theory, vol. 4, pp. 155\u2013174. Luminy (1996).","DOI":"10.1515\/9783110811056.155"},{"key":"262_CR18","doi-asserted-by":"crossref","unstructured":"Silva D., Kschischang 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":"262_CR19","doi-asserted-by":"crossref","unstructured":"Sripati, U., Rajan, B.S.: On the rank distance of cyclic codes. In: Proceedings of the IEEE International Symposium on Information Theory, June (2003).","DOI":"10.1109\/ISIT.2003.1228086"},{"key":"262_CR20","doi-asserted-by":"crossref","unstructured":"Stichtenoth H.: On the dimension of subfield subcodes. IEEE Trans. Inf. Theory 36(1), 90\u201393 (1990).","DOI":"10.1109\/18.50376"},{"key":"262_CR21","doi-asserted-by":"crossref","unstructured":"van Lint J., Wilson R.: On the minimum distance of cyclic codes. IEEE Trans. Inf. Theory 32(1), 23\u201340 (1986).","DOI":"10.1109\/TIT.1986.1057134"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0262-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0262-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0262-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0262-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T15:37:03Z","timestamp":1498318623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0262-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,1]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["262"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0262-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,1]]}}}