{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:49Z","timestamp":1772283589737,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1109\/allerton.2011.6120340","type":"proceedings-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T21:40:38Z","timestamp":1325886038000},"page":"1462-1469","source":"Crossref","is-referenced-by-count":1,"title":["Bounds and exact values in network encoding complexity with two sinks"],"prefix":"10.1109","author":[{"given":"Li","family":"Xu","sequence":"first","affiliation":[]},{"given":"Guangyue","family":"Han","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ITWNIT.2009.5158585"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864435"},{"key":"10","author":"yeung","year":"2006","journal-title":"Network Coding Theory (Foundations and Trends in Communications and Information Theory)"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1080\/00150517.1974.12430745","article-title":"Generating Identities for Pell Triples","volume":"12","author":"serkland","year":"1974","journal-title":"Fibonacci Quart"},{"key":"6","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","article-title":"Zur allgemeinen Kurventhoerie","volume":"10","author":"menger","year":"1927","journal-title":"Fundamentals Math"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874434"},{"key":"9","article-title":"Bounds on Linear Codes for Network Multicast","author":"tavory","year":"2003","journal-title":"Electron Colloq on Computational Complexity"},{"key":"8","author":"song","year":"0","journal-title":"Encoding Complexity for Intersession Network Coding with Two Simple Multicast Sessions"}],"event":{"name":"2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL","start":{"date-parts":[[2011,9,28]]},"end":{"date-parts":[[2011,9,30]]}},"container-title":["2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6111659\/6120135\/06120340.pdf?arnumber=6120340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T15:35:46Z","timestamp":1742312146000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6120340\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/allerton.2011.6120340","relation":{},"subject":[],"published":{"date-parts":[[2011,9]]}}}