{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:42:42Z","timestamp":1775054562740,"version":"3.50.1"},"reference-count":13,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1134\/s0032946016030054","type":"journal-article","created":{"date-parts":[[2016,10,18]],"date-time":"2016-10-18T06:09:18Z","timestamp":1476770958000},"page":"276-283","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multicomponent codes with maximum code distance"],"prefix":"10.1134","volume":"52","author":[{"given":"E. M.","family":"Gabidulin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. I.","family":"Pilipchuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2016,10,19]]},"reference":[{"issue":"2","key":"4271_CR1","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10623-009-9311-1","volume":"54","author":"S. El-Zanati","year":"2010","unstructured":"El-Zanati, S., Jordon, H., Seelinger, G., Sissokho, P., and Spence, L., The Maximum Size of a Partial 3-Spread in a Finite Vector Space over GF(2), Des. Codes Cryptogr., 2010, vol. 54, no. 2, pp. 101\u2013107.","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"4271_CR2","doi-asserted-by":"publisher","first-page":"3579","DOI":"10.1109\/TIT.2008.926449","volume":"54","author":"R. K\u00f6tter","year":"2008","unstructured":"K\u00f6tter, 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":"4271_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"},{"key":"4271_CR4","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)","author":"E.M. 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, July 6\u201311, 2008, pp. 867\u2013870."},{"issue":"4","key":"4271_CR5","first-page":"54","volume":"45","author":"E.M. 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."},{"issue":"1","key":"4271_CR6","first-page":"104","volume":"7","author":"E.M. Gabidulin","year":"2015","unstructured":"Gabidulin, E.M. and Pilipchuk, N.I., Efficiency of Subspace Network Codes, Proc. Moscow Inst. Phys. Technol., 2015, vol. 7, no. 1, pp. 104\u2013111.","journal-title":"Proc. Moscow Inst. Phys. Technol."},{"issue":"1","key":"4271_CR7","first-page":"3","volume":"21","author":"E.M. 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."},{"issue":"4","key":"4271_CR8","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 Authentication Codes: Bounds and Constructions, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 4, pp. 866\u2013873.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4271_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-62012-6","volume-title":"Finite Geometries","author":"P. Dembowski","year":"1968","unstructured":"Dembowski, P., Finite Geometries, Berlin: Springer-Verlag, 1968."},{"issue":"3","key":"4271_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF01215286","volume":"145","author":"A. Beutelspacher","year":"1975","unstructured":"Beutelspacher, A., Partial Spreads in Finite Projective Spaces and Partial Designs, Math. Z., 1975, vol. 145, no. 3, pp. 211\u2013229.","journal-title":"Math. Z."},{"issue":"2","key":"4271_CR11","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BF01919756","volume":"13","author":"D.A. Drake","year":"1979","unstructured":"Drake, D.A. and Freeman, J.W., Partial t-Spreads and Group Constructible (s, r, \u00b5)-Nets, J. Geom., 1979, vol. 13, no. 2, pp. 210\u2013216.","journal-title":"J. Geom."},{"issue":"4","key":"4271_CR12","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF00181559","volume":"9","author":"A. Beutelspacher","year":"1980","unstructured":"Beutelspacher, A., Blocking Sets and Partial Spreads in Finite Projective Spaces, Geom. Dedicata, 1980, vol. 9, no. 4, pp. 425\u2013449.","journal-title":"Geom. Dedicata"},{"issue":"2","key":"4271_CR13","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10623-008-9221-7","volume":"50","author":"T. Xia","year":"2009","unstructured":"Xia, T. and Fu, F.W., Jonson Type Bounds on Constant Dimension Codes, Des. Codes Cryptogr., 2009, vol. 50, no. 2, pp. 163\u2013172.","journal-title":"Des. Codes Cryptogr."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946016030054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946016030054","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946016030054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:36:38Z","timestamp":1775010998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946016030054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["4271"],"URL":"https:\/\/doi.org\/10.1134\/s0032946016030054","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7]]},"assertion":[{"value":"29 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}