{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:11:56Z","timestamp":1725516716551},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540694984"},{"type":"electronic","value":"9783540694991"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69499-1_14","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"157-173","source":"Crossref","is-referenced-by-count":2,"title":["On Field Size and Success Probability in Network Coding"],"prefix":"10.1007","author":[{"given":"Olav","family":"Geil","sequence":"first","affiliation":[]},{"given":"Ryutaroh","family":"Matsumoto","sequence":"additional","affiliation":[]},{"given":"Casper","family":"Thomsen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"14_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., Yeung, R.W.: Network information flow. IEEE Transactions on Information Theory\u00a046(4), 1204\u20131206 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR2","volume-title":"Gr\u00f6bner Bases - A Computational Approach to Commutative Algebra","author":"T. Becker","year":"1993","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner Bases - A Computational Approach to Commutative Algebra. Springer, Berlin (1993)"},{"key":"14_CR3","volume-title":"Ideals, Varieties, and Algorithms","author":"D. Cox","year":"1996","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, 2nd edn. Springer, Berlin (1996)","edition":"2"},{"key":"14_CR4","volume-title":"Foundations and Trends in Networking","author":"C. Fragouli","year":"2007","unstructured":"Fragouli, C., Soljanin, E.: Network Coding Fundamentals. In: Foundations and Trends in Networking, vol.\u00a02(1). now Publishers Inc., Hanover (2007)"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S1071-5797(03)00010-8","volume":"9","author":"O. Geil","year":"2003","unstructured":"Geil, O.: On codes from norm-trace curves. Finite Fields and their Applications\u00a09(3), 351\u2013371 (2003)","journal-title":"Finite Fields and their Applications"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Ho, T., Karger, D.R., M\u00e9dard, M., Koetter, R.: Network Coding from a Network Flow Perspective. In: Proceedings. IEEE International Symposium on Information Theory, Yokohama, Japan, July 2003, p. 441 (2003)","DOI":"10.1109\/ISIT.2003.1228458"},{"issue":"10","key":"14_CR7","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T. Ho","year":"2006","unstructured":"Ho, T., M\u00e9dard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B.: A Random Linear Network Coding Approach to Multicast. IEEE Transactions on Information Theory\u00a052(10), 4413\u20134430 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Jaggi, S., Chou, P.A., Jain, K.: Low Complexity Algebraic Multicast Network Codes. In: Proceedings. IEEE International Symposium on Information Theory, Yokohama, Japan, July 2003, p. 368 (2003)","DOI":"10.1109\/ISIT.2003.1228384"},{"issue":"5","key":"14_CR9","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TNET.2003.818197","volume":"11","author":"R. Koetter","year":"2003","unstructured":"Koetter, R., M\u00e9dard, M.: An Algebraic Approach to Network Coding. IEEE\/ACM Transactions on Networking\u00a011(5), 782\u2013795 (2003)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S.-Y.R. Li","year":"2003","unstructured":"Li, S.-Y.R., Yeung, R.W., Cai, N.: Linear Network Coding. IEEE Transactions on Information Theory\u00a049(2), 371\u2013381 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Sanders, P., Egner, S., Tolhuizen, L.: Polynomial Time Algorithms for Network Information Flow. In: Proceedings of the 15th ACM Symposium on Parallel Algorithms, San Diego, USA, June 2003, pp. 286\u2013294 (2003)","DOI":"10.1145\/777412.777464"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69499-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:48:52Z","timestamp":1557719332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69499-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540694984","9783540694991"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69499-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}