{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T15:51:53Z","timestamp":1769269913604,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T00:00:00Z","timestamp":1476230400000},"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,7]]},"DOI":"10.1007\/s10623-016-0284-6","type":"journal-article","created":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T03:57:50Z","timestamp":1476244670000},"page":"261-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Rank error-correcting pairs"],"prefix":"10.1007","volume":"84","author":[{"given":"Umberto","family":"Mart\u00ednez-Pe\u00f1as","sequence":"first","affiliation":[]},{"given":"Ruud","family":"Pellikaan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,12]]},"reference":[{"issue":"11","key":"284_CR1","doi-asserted-by":"crossref","first-page":"3016","DOI":"10.1109\/TIT.2003.819322","volume":"49","author":"TP Berger","year":"2003","unstructured":"Berger T.P.: Isometries for rank distance and permutation group of Gabidulin codes. IEEE Trans. Inf. Theory 49(11), 3016\u20133019 (2003).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"284_CR2","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/s00200-007-0043-z","volume":"18","author":"D Boucher","year":"2007","unstructured":"Boucher D., Geiselmann W., Ulmer F.: Skew-cyclic codes. Appl. Algebra Eng. Commun. Comput. 18(4), 379\u2013389 (2007).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"3","key":"284_CR3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10623-008-9230-6","volume":"50","author":"L Chaussade","year":"2009","unstructured":"Chaussade L., Loidreau P., Ulmer F.: Skew codes of prescribed distance or rank. Des. Codes Cryptogr. 50(3), 267\u2013284 (2009).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"284_CR4","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226\u2013241 (1978).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"5","key":"284_CR5","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1109\/TIT.1975.1055435","volume":"21","author":"P Delsarte","year":"2006","unstructured":"Delsarte P.: On subfield subcodes of modified reed-solomon codes. IEEE Trans. Inf. Theory 21(5), 575\u2013576 (2006).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"284_CR6","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1109\/18.335964","volume":"40","author":"IM Duursma","year":"1994","unstructured":"Duursma I.M., K\u00f6tter R.: Error-locating pairs for cyclic codes. IEEE Trans. Inf. Theory 40(4), 1108\u20131121 (1994).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"284_CR7","doi-asserted-by":"crossref","first-page":"1677","DOI":"10.1016\/j.jcta.2006.03.020","volume":"113","author":"IM Duursma","year":"2006","unstructured":"Duursma I.M., Pellikaan R.: A symmetric Roos bound for linear codes. J. Comb. Theory Ser. A 113(8), 1677\u20131688 (2006).","journal-title":"J. Comb. Theory Ser. A"},{"key":"284_CR8","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin E.M.: Theory of codes with maximum rank distance. Prob. Inf. Transm. 21, 3\u201316 (1985).","journal-title":"Prob. Inf. Transm."},{"key":"284_CR9","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"},{"issue":"5","key":"284_CR10","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/S0019-9958(72)90887-X","volume":"20","author":"CRP Hartmann","year":"1972","unstructured":"Hartmann C.R.P., Tzeng K.K.: Generalizations of the BCH bound. Inf. Control 20(5), 489\u2013498 (1972).","journal-title":"Inf. Control"},{"key":"284_CR11","unstructured":"Jurrius R.P.M.J., Pellikaan R.: The extended and generalized rank weight enumerator. ACA 2014, Applications of Computer Algebra, 9 July 2014, Fordham University, New York, Computer Algebra in Coding Theory and Cryptography (2014)."},{"key":"284_CR12","unstructured":"Jurrius R.P.M.J., Pellikaan R.: On defining generalized rank weights. \n                        arXiv:1506.02865\n                        \n                     (2015)."},{"key":"284_CR13","unstructured":"K\u00f6tter R.: A unified description of an error locating procedure for linear codes. In: Proceedings of Algebraic and Combinatorial Coding Theory, Voneshta Voda, pp. 113\u2013117 (1992)."},{"key":"284_CR14","doi-asserted-by":"crossref","unstructured":"Kshevetskiy A., Gabidulin E.M.: The new construction of rank codes. In: IEEE International Symposium on Information Theory (ISIT 2005), pp. 2105\u20132108 (2005).","DOI":"10.1109\/ISIT.2005.1523717"},{"key":"284_CR15","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, vol. 20. Addison-Wesley, Amsterdam (1983)."},{"key":"284_CR16","first-page":"36","volume-title":"Coding and Cryptography. Lecture Notes in Computer Science","author":"P Loidreau","year":"2006","unstructured":"Loidreau P.: A Welch\u2013Berlekamp like algorithm for decoding Gabidulin codes. In: Ytrehus \u00d8. (ed.) Coding and Cryptography. Lecture Notes in Computer Science, vol. 3969, pp. 36\u201345. Springer, Berlin (2006)."},{"key":"284_CR17","doi-asserted-by":"publisher","unstructured":"Mart\u00ednez-Pe\u00f1as U.: On the roots and minimum rank distance of skew cyclic codes. Des. Codes Cryptogr. (2016). doi:\n                        10.1007\/s10623-016-0262-z\n                        \n                    .","DOI":"10.1007\/s10623-016-0262-z"},{"issue":"7","key":"284_CR18","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":"284_CR19","unstructured":"Pellikaan R.: On decoding linear codes by error correcting pairs. Preprint, Eindhoven University of Technology (1988)."},{"key":"284_CR20","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/0012-365X(92)90567-Y","volume":"106","author":"R Pellikaan","year":"1992","unstructured":"Pellikaan R.: On decoding by error location and dependent sets of error positions. Discret. Math. 106, 369\u2013381 (1992).","journal-title":"Discret. Math."},{"key":"284_CR21","doi-asserted-by":"crossref","unstructured":"Pellikaan R.: On the existence of error-correcting pairs. J. Stat. Plan. Inference 51(2), 229\u2013242 (1996). Shanghai Conference Issue on Designs, Codes, and Finite Geometries, Part I.","DOI":"10.1016\/0378-3758(95)00088-7"},{"issue":"1","key":"284_CR22","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10623-015-0077-3","volume":"80","author":"A Ravagnani","year":"2015","unstructured":"Ravagnani A.: Rank-metric codes and their duality theory. Des. Codes Cryptogr. 80(1), 197\u2013216 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"284_CR23","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0097-3165(82)90014-0","volume":"33","author":"C Roos","year":"1982","unstructured":"Roos C.: A generalization of the BCH bound for cyclic codes, including the Hartmann\u2013Tzeng bound. J. Comb. Theory Ser. A 33, 229\u2013232 (1982).","journal-title":"J. Comb. Theory Ser. A"},{"key":"284_CR24","first-page":"330","volume":"IT\u201329","author":"C Roos","year":"1982","unstructured":"Roos C.: A new lower bound for the minimum distance of a cyclic code. IEEE Trans. Inf. Theory IT\u201329, 330\u2013332 (1982).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"284_CR25","doi-asserted-by":"crossref","first-page":"5479","DOI":"10.1109\/TIT.2009.2032817","volume":"55","author":"D Silva","year":"2009","unstructured":"Silva D., Kschischang F.R.: On metrics for error correction in network coding. IEEE Trans. Inf. Theory 55(12), 5479\u20135490 (2009).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0284-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0284-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0284-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T07:15:57Z","timestamp":1495437357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0284-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,12]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0284-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,12]]}}}