{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:09:38Z","timestamp":1775012978918,"version":"3.50.1"},"reference-count":29,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"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":[[2009,12]]},"DOI":"10.1134\/s003294600904005x","type":"journal-article","created":{"date-parts":[[2010,1,19]],"date-time":"2010-01-19T19:59:16Z","timestamp":1263931156000},"page":"343-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Algebraic codes for network coding"],"prefix":"10.1134","volume":"45","author":[{"given":"E. M.","family":"Gabidulin","sequence":"first","affiliation":[]},{"given":"M.","family":"Bossert","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2010,1,21]]},"reference":[{"issue":"7","key":"4060_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"47","author":"R. Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.R., and Yeung, R.W., Network Information Flow, IEEE Trans. Inform. Theory, 2000, vol. 47, no. 7, pp. 1204\u20131216.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4060_CR2","doi-asserted-by":"crossref","unstructured":"Sanders, P., Egner, S., and Tolhuizen, L., Polynomial Time Algorithms for Network Information Flow, in Proc. 15th Annual ACM Sympos. on Parallelism in Algorithms and Architectures, San Diego, USA, 2003, pp. 286\u2013294.","DOI":"10.1145\/777412.777464"},{"key":"4060_CR3","unstructured":"Li, Z., Li, B., Jiang, D., and Lau, L.C., On Achieving Optimal End-to-End Throughput in Data Networks: Theoretical and Empirical Studies, ECE Tech. Rep., Univ. of Toronto, February, 2004."},{"key":"4060_CR4","doi-asserted-by":"crossref","unstructured":"Agarwal, A. and Charikar, M., On the Advantage of Network Coding for Improving Network Throughput, in Proc. IEEE Information Theory Workshop, San Antonio, USA, 2004, pp. 247\u2013249.","DOI":"10.1109\/ITW.2004.1405308"},{"key":"4060_CR5","doi-asserted-by":"crossref","unstructured":"Kramer, G. and Savari, S.A., Cut Sets and Information Flow in Networks of Two-Way Channels, in Proc. 2004 IEEE Int. Sympos. on Information Theory (ISIT\u20192004), Chicago, USA, 2004, p. 33.","DOI":"10.1109\/ISIT.2004.1365070"},{"key":"4060_CR6","doi-asserted-by":"crossref","unstructured":"Ho, T., Koetter, R., M\u00e9dard, M., Karger, D.R., and Effros, M., The Benefits of Coding over Routing in a Randomized Setting, in Proc. 2003 Int. Sympos. on Information Theory (ISIT\u20192003), Yokohama, Japan, 2003, p. 442.","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"4060_CR7","doi-asserted-by":"crossref","unstructured":"Fragouli, C. and Soljanin, E., Decentralized Network Coding, in Proc. IEEE Information Theory Workshop, San Antonio, USA, 2004, pp. 310\u2013314.","DOI":"10.1109\/ITW.2004.1405320"},{"key":"4060_CR8","unstructured":"Cai, N. and Yeung, R.W., Secure Network Coding, in Proc. 2002 IEEE Int. Sympos. on Information Theory (ISIT\u20192002), Lausanne, Switzerland, 2002, p. 323."},{"key":"4060_CR9","unstructured":"Bhattad, K. and Narayanan, K.R., Weakly Secure Network Coding, in Proc. 1st Workshop on Network Coding, Theory, and Applications (NetCod\u201905), Riva del Garda, Italy, 2005."},{"key":"4060_CR10","unstructured":"Ho, T., Leong, B., Koetter, R., M\u00e9dard, M., Effros, M., and Karger, D., Byzantine Modification Detection in Multicast Networks using Randomized Network Coding, in Proc. 2004 IEEE Int. Sympos. on Information Theory (ISIT\u20192004), Chicago, USA, 2004, p. 144."},{"key":"4060_CR11","doi-asserted-by":"crossref","unstructured":"Jaggi, S., Langberg, M., Katti, S., Ho, T., Katabi, D., and M\u00e9dard, M., Resilient Network Coding in the Presence of Byzantine Adversaries, in Proc. 26th IEEE Int. Conf. on Computer Communications (INFOCOM\u20192007), Anchorage, USA, 2007, pp. 616\u2013624.","DOI":"10.1109\/INFCOM.2007.78"},{"issue":"11","key":"4060_CR12","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1109\/TCOMM.2005.857148","volume":"53","author":"Y. Wu","year":"2005","unstructured":"Wu, Y., Chou, P.A., and Kung, S.-Y., Minimum-Energy Multicast in Mobile ad hoc Networks Using Networks Coding, IEEE Trans. Commun., 2005, vol. 53, no. 11, pp. 1906\u20131918.","journal-title":"IEEE Trans. Commun."},{"key":"4060_CR13","doi-asserted-by":"crossref","unstructured":"Fragouli, C., Widmer, J., and Le Boudec, J.-Y., A Network Coding Approach to Energy Efficient Broadcasting: From Theory to Practice, in Proc. 25th IEEE Int. Conf. on Computer Communications (INFOCOM\u20192006), Barcelona, Spain, 2006.","DOI":"10.1109\/INFOCOM.2006.45"},{"issue":"1","key":"4060_CR14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4310\/CIS.2006.v6.n1.a2","volume":"6","author":"R.W. Yeung","year":"2006","unstructured":"Yeung, R.W. and Cai, N., Network Error Correction. I. Basic Concepts and Upper Bounds, Commun. Inform. Systems, 2006, vol. 6, no. 1, pp. 19\u201335.","journal-title":"Commun. Inform. Systems"},{"issue":"1","key":"4060_CR15","doi-asserted-by":"crossref","first-page":"37","DOI":"10.4310\/CIS.2006.v6.n1.a3","volume":"6","author":"N. Cai","year":"2006","unstructured":"Cai, N. and Yeung, R.W., Network Error Correction. II. Lower Bounds, Commun. Inform. Systems, 2006, vol. 6, no. 1, pp. 37\u201354.","journal-title":"Commun. Inform. Systems"},{"key":"4060_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Network Error Correction Coding in Packetized Networks, in Proc. 2006 IEEE Information Theory Workshop (ITW\u201906), Chengdu, China, 2006, pp. 433\u2013437.","DOI":"10.1109\/ITW2.2006.323836"},{"key":"4060_CR17","unstructured":"Yang, S. and Yeung, R.W., Characterizations of Network Error Correction\/Detection and Erasure Correction, in Proc. 3rd Workshop on Network Coding, Theory, and Applications (NetCod\u201907), San Diego, USA, 2007."},{"key":"4060_CR18","doi-asserted-by":"crossref","unstructured":"Yang, S., Ngai, C.K., and Yeung, R.W., Construction of Linear Network Codes that Achieve a Refined Singleton Bound, in Proc. 2007 IEEE Int. Sympos. on Information Theory (ISIT\u20192007), Nice, France, 2007, pp. 1576\u20131580.","DOI":"10.1109\/ISIT.2007.4557139"},{"issue":"4","key":"4060_CR19","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1109\/TIT.2005.844062","volume":"51","author":"T. Ho","year":"2005","unstructured":"Ho, T., M\u00e9dard, M., and Koetter, R., An Information-Theoretic View of Network Management, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 4, pp. 1295\u20131312.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"4060_CR20","doi-asserted-by":"crossref","unstructured":"Koetter, R. and Kschischang, F.R., Coding for Errors and Erasures in Random Network Coding, inProc. 2007 IEEE Int. Sympos. on Information Theory (ISIT\u20192007), Nice, France, 2007, pp. 791\u2013795.","DOI":"10.1109\/ISIT.2007.4557321"},{"key":"4060_CR21","doi-asserted-by":"crossref","unstructured":"Silva, D. and Kschischang, F.R., Using Rank-Metric Codes for Error Correction in Random Network Coding, in Proc. 2007 IEEE Int. Sympos. on Information Theory (ISIT\u20192007), Nice, France, 2007, pp. 24\u201329.","DOI":"10.1109\/ISIT.2007.4557322"},{"key":"4060_CR22","doi-asserted-by":"crossref","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.","DOI":"10.1109\/ISIT.2008.4595110"},{"key":"4060_CR23","doi-asserted-by":"crossref","unstructured":"Etzion, T. and Vardy, A., Error-Correcting Codes in Projective Space, in Proc. 2008 IEEE Int. Sympos. on Information Theory (ISIT\u20192008), Toronto, Canada, 2008, pp. 871\u2013875.","DOI":"10.1109\/ISIT.2008.4595111"},{"issue":"5","key":"4060_CR24","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1109\/18.623158","volume":"43","author":"L.M.G.M. Tolhuizen","year":"1997","unstructured":"Tolhuizen, L.M.G.M., The Generalized Gilbert-Varshamov Bound Is Implied by Turan\u2019s Theorem, IEEE Trans. Inform. Theory, 1997, vol. 43, no. 5, pp. 1605\u20131606.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"4060_CR25","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/0097-3165(76)90017-0","volume":"20","author":"P. Delsarte","year":"1976","unstructured":"Delsarte, P., Association Schemes and t-Designs in Regular Semilattices, J. Combin. Theory, Ser. A, 1976, vol. 20, no. 2, pp. 230\u2013243.","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"2","key":"4060_CR26","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1137\/0131021","volume":"31","author":"P. Delsarte","year":"1976","unstructured":"Delsarte, P., Properties and Applications of the Recurrence F(i+1; k + 1; n + 1) = q\n                           k+1\n                           F(i; k + 1; n)- q\n                           k\n                           F(i; k; n), SIAM J. Appl. Math., 1976, vol. 31, no. 2, pp. 262\u2013270.","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"4060_CR27","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1137\/0134012","volume":"34","author":"P. Delsarte","year":"1978","unstructured":"Delsarte, P., Hahn Polynomials, Discrete Harmonics, and t-Designs, SIAM J. Appl. Math., 1978, vol. 34, no. 1, pp. 157\u2013166.","journal-title":"SIAM J. Appl. Math."},{"key":"4060_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01230125","volume":"22","author":"P.V. Ceccherini","year":"1984","unstructured":"Ceccherini, P.V., A q-Analogous of the Characterization of Hypercubes as Graphs, J. Geom., 1984, vol. 22, pp. 57\u201374.","journal-title":"J. Geom."},{"issue":"2","key":"4060_CR29","first-page":"12","volume":"42","author":"A. Barg","year":"2006","unstructured":"Barg, A. and Nogin, D.Yu., Spectral Approach to Linear Programming Bounds on Codes, Probl. Peredachi Inf., 2006, vol. 42, no. 2, pp. 12\u201325 [Probl. Inf. Trans. (Engl. Transl.), 2006, vol. 42, no. 2, pp. 77\u201389].","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\/S003294600904005X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S003294600904005X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S003294600904005X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S003294600904005X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:04:29Z","timestamp":1775009069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S003294600904005X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["4060"],"URL":"https:\/\/doi.org\/10.1134\/s003294600904005x","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12]]},"assertion":[{"value":"26 January 2009","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2009","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2010","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}