{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:38:53Z","timestamp":1775014733372,"version":"3.50.1"},"reference-count":27,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1134\/s0032946013010043","type":"journal-article","created":{"date-parts":[[2013,4,12]],"date-time":"2013-04-12T00:12:18Z","timestamp":1365725538000},"page":"40-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Rank subcodes in multicomponent network coding"],"prefix":"10.1134","volume":"49","author":[{"given":"E. M.","family":"Gabidulin","sequence":"first","affiliation":[]},{"given":"N. I.","family":"Pilipchuk","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2013,4,13]]},"reference":[{"issue":"4","key":"4160_CR1","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1109\/TIT.2003.809567","volume":"49","author":"H Wang","year":"2003","unstructured":"Wang, H., Xing, C., and Safavi-Naini, R., Linear Autentication Codes: Bounds and Constructions, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 4, pp. 866\u2013873.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"4160_CR2","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R Koetter","year":"2008","unstructured":"Koetter, R. and Kschischang, F.R., Coding for Errors and Erasures in Random Network Coding, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 8, pp. 3579\u20133591.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"4160_CR3","doi-asserted-by":"publisher","first-page":"3951","DOI":"10.1109\/TIT.2008.928291","volume":"54","author":"D Silva","year":"2008","unstructured":"Silva, D., Kschischang, F.R., and K\u00f6tter, R., A Rank-Metric Approach to Error Control in Random Network Coding, IEEE Trans. Inform. Theory, 2008, vol. 54, no. 9, pp. 3951\u20133967.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"4160_CR4","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M., Theory of Codes with Maximum Rank Distance, Probl. Peredachi Inf., 1985, vol. 21, no. 1, pp. 3\u201316 [Probl. Inf. Trans. (Engl. Transl.), 1985, vol. 21, no. 1, pp. 1\u201312].","journal-title":"Probl. Peredachi Inf."},{"key":"4160_CR5","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/ISIT.2008.4595110","volume-title":"Proc. 2008 IEEE Int. Sympos. on Information Theory (ISIT\u20192008), Toronto, Canada","author":"EM Gabidulin","year":"2008","unstructured":"Gabidulin, E.M. and Bossert, M., Codes for Network Coding, in Proc. 2008 IEEE Int. Sympos. on Information Theory (ISIT\u20192008), Toronto, Canada, 2008, pp. 867\u2013870."},{"issue":"4","key":"4160_CR6","first-page":"54","volume":"45","author":"EM Gabidulin","year":"2009","unstructured":"Gabidulin, E.M. and Bossert, M., Algebraic Codes for Network Coding, Probl. Peredachi Inf., 2009, vol. 45, no. 4, pp. 54\u201368 [Probl. Inf. Trans. (Engl. Transl.), 2009, vol. 45, no. 4, pp. 343\u2013356].","journal-title":"Probl. Peredachi Inf."},{"key":"4160_CR7","unstructured":"Gabidulin, E.M. and Pilipchuk, N.I., Multicomponent Network Coding, in Proc. 7th Int. Workshop on Coding and Cryptography (WCC\u20192011), Paris, France, 2011, pp. 443\u2013452."},{"key":"4160_CR8","volume-title":"Proc. Int. Mathematical Conf. \u201c50 years of IITP,\u201d Moscow, 2011","author":"EM Gabidulin","year":"2011","unstructured":"Gabidulin, E.M. and Pilipchuk, N.I., New Multicomponent Network Codes Based on Block Designs, in Proc. Int. Mathematical Conf. \u201c50 years of IITP,\u201d Moscow, 2011, Moscow: Inst. Inf. Trans. Probl., 2011 (CD)."},{"issue":"3","key":"4160_CR9","doi-asserted-by":"publisher","first-page":"1378","DOI":"10.1109\/TIT.2009.2039163","volume":"56","author":"V Skachek","year":"2010","unstructured":"Skachek, V., Recursive Code Construction for Random Networks, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 3, pp. 1378\u20131382.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4160_CR10","doi-asserted-by":"crossref","unstructured":"Gadouleau, M. and Yan, Z., Construction and Covering Properties of Constant-Dimension Codes, in Proc. 2009 IEEE Int. Sympos. on Information Theory (ISIT\u20192009), Seoul, Korea, 2009, pp. 2221\u20132225.","DOI":"10.1109\/ISIT.2009.5205850"},{"issue":"7","key":"4160_CR11","doi-asserted-by":"publisher","first-page":"2909","DOI":"10.1109\/TIT.2009.2021376","volume":"55","author":"T Etzion","year":"2009","unstructured":"Etzion, T. and Silberstein, N., Error-Correcting Codes in Projective Space via Rank-Metric Codes and Ferrers Diagrams, IEEE Trans. Inform. Theory, 2009, vol. 55, no. 7, pp. 2909\u20132919.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4160_CR12","volume-title":"Codes and Designs Related to Lifted MRD Codes","author":"T Etzion","year":"2011","unstructured":"Etzion, T. and Silberstein, N., Codes and Designs Related to Lifted MRD Codes, arXiv:1102.2593v4 [cs.IT], 2011."},{"issue":"2","key":"4160_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.3934\/amc.2011.5.177","volume":"5","author":"N Silberstein","year":"2011","unstructured":"Silberstein, N. and Etzion, T., Large Constant Dimension Codes and Lexicodes, Adv. Math. Commun., 2011, vol. 5, no. 2, pp. 177\u2013189.","journal-title":"Adv. Math. Commun."},{"key":"4160_CR14","doi-asserted-by":"crossref","unstructured":"Silberstein, N. and Etzion, T., Codes and Designs Related to Lifted MRD Codes, in Proc. 2011 IEEE Int. Sympos. on Information Theory (ISIT\u20192011), St. Petersburg, Russia, 2011, pp. 2288\u20132292.","DOI":"10.1109\/ISIT.2011.6033969"},{"key":"4160_CR15","unstructured":"Pilipchuk, N.I., Gabidulin, E.M., and Afanasiev, V.B., Decoding Multicomponent Codes Based on Rank Subcodes, in Proc. 13th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT\u20192012), Pomorie, Bulgaria, 2012, pp. 275\u2013281."},{"key":"4160_CR16","volume-title":"The Theory of Partitions","author":"GE Andrews","year":"1976","unstructured":"Andrews, G.E., The Theory of Partitions, Reading, MA: Addison-Wesley, 1976. Translated under the title Teoriya razbienii, Moscow: Nauka, 1982."},{"key":"4160_CR17","volume-title":"Combinatorial Theory","author":"M Hall Jr.","year":"1967","unstructured":"Hall, M., Jr., Combinatorial Theory, Waltham: Blaisdell, 1967. Translated under the title Kombinatorika, Moscow: Mir, 1970."},{"issue":"2","key":"4160_CR18","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1109\/18.661517","volume":"44","author":"V Tarokh","year":"1998","unstructured":"Tarokh, V., Jafarkhani, H., and Calderbank, A.R., Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction, IEEE Trans. Inform. Theory, 1998, vol. 44, no. 2, pp. 744\u2013765.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4160_CR19","unstructured":"Gabidulin, E.M., Bossert, M., and Lusina, P., Space-Time Codes Based on Rank Codes, in Proc. 2000 IEEE Int. Symp. on Information Theory (ISIT\u20192000), Sorrento, Italy, p. 283."},{"key":"4160_CR20","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology (Proc. EUROCRYPT\u201991: Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, 1991)","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., and Tretjakov, O.V., Ideals over a Non-commutative Ring and Their Application in Cryptology, Advances in Cryptology (Proc. EUROCRYPT\u201991: Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, 1991), Davies, D.W., Ed., Lect. Notes Comp. Sci., vol. 547, Berlin: Springer, 1991, pp. 482\u2013489."},{"issue":"4","key":"4160_CR21","first-page":"33","volume":"46","author":"EM Gabidulin","year":"2010","unstructured":"Gabidulin, E.M., Pilipchuk, N.I., and Bossert, M., Decoding of Random Network Codes, Probl. Peredachi Inf., 2010, vol. 46, no. 4, pp. 33\u201355 [Probl. Inf. Trans. (Engl. Transl.), 2010, vol. 46, no. 4, pp. 300\u2013320].","journal-title":"Probl. Peredachi Inf."},{"key":"4160_CR22","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/BFb0034349","volume-title":"Proc. 1st French-Soviet Workshop on Algebraic Coding, Paris, France, 1991","author":"EM Gabidulin","year":"1992","unstructured":"Gabidulin, E.M., A FastMatrix Decoding Algorithm for Rank-Error-CorrectingCodes, Proc. 1st French-Soviet Workshop on Algebraic Coding, Paris, France, 1991, Cohen, G.D., Litsyn, S., Lobstein, A., and Z\u00e9mor, G., Eds., Lect. Notes Comp. Sci., vol. 573, Berlin: Springer, 1992, pp. 126\u2013133."},{"key":"4160_CR23","volume-title":"Proc. Moscow Inst. Physics and Technology, Moscow","author":"AV Paramonov","year":"1991","unstructured":"Paramonov, A.V. and Tretjakov, O.V., An Analogue of Berlekamp-Massey Algorithm for Decoding Codes in Rank Metric, in Proc. Moscow Inst. Physics and Technology, Moscow, 1991."},{"issue":"9","key":"4160_CR24","doi-asserted-by":"publisher","first-page":"6025","DOI":"10.1109\/TIT.2011.2162173","volume":"57","author":"V Sidorenko","year":"2011","unstructured":"Sidorenko, V., Richter, G., and Bossert, M., Linearized Shift-Register Synthesis, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 9, pp. 6025\u20136032.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4160_CR25","series-title":"Itrehus, Comp. Sci.","first-page":"36","volume-title":"Proc. 4th Int. Workshop on Coding and Cryptography (WCC\u20192005), Bergen, Norway, 2005","author":"P Loidreau","year":"2006","unstructured":"Loidreau, P., A Welch-Berlekamp Like Algorithm for Decoding Gabidulin Codes, Proc. 4th Int. Workshop on Coding and Cryptography (WCC\u20192005), Bergen, Norway, 2005, Itrehus, Comp. Sci., vol. 3969. Berlin: Springer, 2006, pp. 36\u201345."},{"key":"4160_CR26","unstructured":"Wachter, A.V., Afanasiev, V.B., and Sidorenko, V.R., Fast Decoding of Gabidulin Codes, in Proc. 7th Int. Workshop on Coding and Cryptography (WCC\u20192011), Paris, France, 2011, pp. 433\u2013442."},{"key":"4160_CR27","doi-asserted-by":"crossref","unstructured":"Sidorenko, V., Schmidt, G., Gabidulin, E.M., Bossert, M., and Afanasiev, V.B., On Polyalphabetic Block Codes, in Proc. 2005 IEEE ITSOC Information Theory Workshop on Coding and Complexity (ITW\u20192005), Rotorua, New Zealand, 2005, pp. 207\u2013210.","DOI":"10.1109\/ITW.2005.1531889"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946013010043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946013010043","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946013010043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946013010043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:21:11Z","timestamp":1775010071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946013010043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["4160"],"URL":"https:\/\/doi.org\/10.1134\/s0032946013010043","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]},"assertion":[{"value":"13 August 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2012","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2013","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}