{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:31:36Z","timestamp":1775017896964,"version":"3.50.1"},"reference-count":15,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"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":[[2021,7]]},"DOI":"10.1134\/s0032946021030030","type":"journal-article","created":{"date-parts":[[2021,10,7]],"date-time":"2021-10-07T09:22:04Z","timestamp":1633598524000},"page":"241-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bounds on the Cardinality of Subspace Codes with Non-maximum Code Distance"],"prefix":"10.1134","volume":"57","author":[{"given":"E. M.","family":"Gabidulin","sequence":"first","affiliation":[]},{"given":"N. I.","family":"Pilipchuk","sequence":"additional","affiliation":[]},{"given":"O. V.","family":"Trushina","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2021,10,7]]},"reference":[{"issue":"4","key":"5027_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.-Y.R., and Yeung, R.W., Network Information Flow, IEEE Trans. Inform. Theory, 2000, vol.\u00a046, no.\u00a04, pp.\u00a01204\u20131216. https:\/\/doi.org\/10.1109\/18.850663","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"5027_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1145\/1165389.945450","volume":"37","author":"S Ghemawat","year":"2003","unstructured":"Ghemawat, S., Gobioff, H., and Leung, S.-T., The Google File System, ACM SIGOPS Oper. Syst. Rev., 2003, vol.\u00a037, no.\u00a05, pp.\u00a029\u201343. https:\/\/doi.org\/10.1145\/1165389.945450","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"issue":"2","key":"5027_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10623-008-9221-7","volume":"50","author":"S-T Xia","year":"2009","unstructured":"Xia, S.-T. and Fu, F.-W., Johnson Type Bounds on Constant Dimension Codes, Des. Codes Cryptography, 2009, vol.\u00a050, no.\u00a02, pp.\u00a0163\u2013172. https:\/\/doi.org\/10.1007\/s10623-008-9221-7","journal-title":"Des. Codes Cryptography"},{"issue":"3","key":"5027_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1134\/S0032946016030054","volume":"52","author":"EM Gabidulin","year":"2016","unstructured":"Gabidulin, E.M. and Pilipchuk, N.I., Multicomponent Codes with Maximum Code Distance, Probl. Peredachi Inf., 2016, vol.\u00a052, no.\u00a03, pp.\u00a085\u201392 [Probl. Inf. Transm. (Engl. Transl.), 2016, vol.\u00a052, no.\u00a03, pp.\u00a0276\u2013283]. https:\/\/doi.org\/10.1134\/S0032946016030054","journal-title":"Probl. Peredachi Inf."},{"key":"5027_CR5","doi-asserted-by":"publisher","unstructured":"Gabidulin, E.M. and Bossert, M., Codes for Network Coding, in Proc. 2008 IEEE Int. Symp. on Information Theory (ISIT\u20192008), Toronto, Canada, July 6\u201311, 2008, pp.\u00a0867\u2013870. https:\/\/doi.org\/10.1109\/ISIT.2008.4595110","DOI":"10.1109\/ISIT.2008.4595110"},{"issue":"8","key":"5027_CR6","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.\u00a054, no.\u00a08, pp.\u00a03579\u20133591. https:\/\/doi.org\/10.1109\/TIT.2008.926449","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"9","key":"5027_CR7","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.\u00a054, no.\u00a09, pp.\u00a03951\u20133967. https:\/\/doi.org\/10.1109\/TIT.2008.928291","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"5027_CR8","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.\u00a021, no.\u00a01, pp.\u00a03\u201316 [Probl. Inf. Transm. (Engl. Transl.), 1985, vol.\u00a021, no.\u00a01, pp.\u00a01\u201312]. http:\/\/mi.mathnet.ru\/eng\/ppi967","journal-title":"Probl. Peredachi Inf."},{"key":"5027_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1017\/fmp.2016.5","volume":"4","author":"M Braun","year":"2016","unstructured":"Braun, M., Etzion, T., \u00d6sterg\u00e5rd, P.R.G., Vardy, A., and Wassermann, A., Existence of q-Analogs of Steiner Systems, Forum Math. Pi, 2016, vol.\u00a04, Research Paper e7 (14\u00a0pp.). https:\/\/doi.org\/10.1017\/fmp.2016.5","journal-title":"Forum Math. Pi"},{"key":"5027_CR10","doi-asserted-by":"crossref","unstructured":"Honold, T., Kiermaier, M., and Kurz, S., Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4, https:\/\/arXiv.org\/abs\/1311.0464v2 [math.CO], 2014.","DOI":"10.1090\/conm\/632\/12627"},{"key":"5027_CR11","unstructured":"Liu, H. and Honold, T., A New Approach to the Main Problem of Subspace Coding, https:\/\/arXiv.org\/abs\/1408.1181 [math.CO], 2014."},{"key":"5027_CR12","unstructured":"Heinlein, D. and Kurz, S., An Upper Bound for Binary Subspace Codes of Length 8, Constant Dimension 4 and Minimum Distance 6, Proc. 10th Int. Workshop on Coding and Cryptography (WCC\u20192017), St.\u00a0Petersburg, Russia, Sept. 18\u201322, 2017, Augot,\u00a0D., Krouk,\u00a0E., and Loidreau,\u00a0P., Eds., 11\u00a0pp."},{"issue":"9","key":"5027_CR13","doi-asserted-by":"publisher","first-page":"6315","DOI":"10.1109\/TIT.2018.2839596","volume":"64","author":"L Xu","year":"2018","unstructured":"Xu, L. and Chen, H., New Constant-Dimension Subspace Codes from Maximum Rank Distance Codes, IEEE Trans. Inform. Theory, 2018, vol.\u00a064, no.\u00a09, pp.\u00a06315\u20136319. https:\/\/doi.org\/10.1109\/TIT.2018.2839596","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5027_CR14","unstructured":"He, X. and Chen, Y., Constructions of Const Dimension Codes from Serval Parallel Lift MRD Code, https:\/\/arXiv.org\/abs\/1911.00154 [cs.IT], 2019."},{"issue":"4","key":"5027_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1134\/S0032946010040034","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.\u00a046, no.\u00a04, pp.\u00a033\u201355 [Probl. Inf. Transm. (Engl. Transl.), 2010, vol.\u00a046, no.\u00a04, pp.\u00a0300\u2013320]. https:\/\/doi.org\/10.1134\/S0032946010040034","journal-title":"Probl. Peredachi Inf."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946021030030.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946021030030","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946021030030.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:48:55Z","timestamp":1775011735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946021030030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["5027"],"URL":"https:\/\/doi.org\/10.1134\/s0032946021030030","relation":{"is-translation-of":[{"id-type":"doi","id":"10.31857\/S0555292321030037","asserted-by":"subject"}]},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"3 February 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}