{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:41:02Z","timestamp":1776444062423,"version":"3.51.2"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1109\/tit.2013.2283075","type":"journal-article","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T19:49:35Z","timestamp":1380311375000},"page":"422-431","source":"Crossref","is-referenced-by-count":41,"title":["Computing Linear Functions by Linear Coding Over Networks"],"prefix":"10.1109","volume":"60","author":[{"given":"Rathinakumar","family":"Appuswamy","sequence":"first","affiliation":[]},{"given":"Massimo","family":"Franceschetti","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205926"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904785"},{"key":"ref12","first-page":"142","article-title":"Complexity classification of network information flow problems","author":"lehman","year":"2003","journal-title":"Proc 15th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref13","author":"rasala lehman","year":"2005","journal-title":"Network Coding"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.851744"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920209"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095070"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095070"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2168902"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909156"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2006.1632656"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2188883"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2169532"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843543"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595267"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503143"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130404"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref21","author":"hungerford","year":"1997","journal-title":"Algebra"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6690264\/06613524.pdf?arnumber=6613524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:53Z","timestamp":1638218873000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6613524\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1]]},"references-count":21,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2283075","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1]]}}}