{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:52Z","timestamp":1740122572166,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T00:00:00Z","timestamp":1717977600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["1547399"],"award-info":[{"award-number":["1547399"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["VI.Vidi.203.045","OCENW.KLEIN.539"],"award-info":[{"award-number":["VI.Vidi.203.045","OCENW.KLEIN.539"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001722","name":"Koninklijke Nederlandse Akademie van Wetenschappen","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001722","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006498","name":"Clemson University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100006498","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a formal framework to study the multiple unicast problem for a coded network in which the network code is linear over a finite field and fixed. We show that the problem corresponds to an interference alignment problem over a finite field. In this context, we establish an outer bound for the achievable rate region and provide examples of networks where the bound is sharp. We finally give evidence of the crucial role played by the field characteristic in the problem.\n<\/jats:p>","DOI":"10.1007\/s10623-024-01439-1","type":"journal-article","created":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T15:02:38Z","timestamp":1718031758000},"page":"3355-3369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["External codes for multiple unicast networks via interference alignment"],"prefix":"10.1007","volume":"92","author":[{"given":"F. R.","family":"Kschischang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5764-569X","authenticated-orcid":false,"given":"F.","family":"Manganiello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Ravagnani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Savary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,10]]},"reference":[{"key":"1439_CR1","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"464","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede R., Cai N., Li S.-Y.R., Yeung R.W.: Network information flow. IEEE Trans. Info. Theory 464, 1204\u20131216 (2000).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1439_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"492","author":"S-YR Li","year":"2003","unstructured":"Li S.-Y.R., Yeung R.W., Cai N.: Linear network coding. IEEE Trans. Info. Theory 492, 371\u2013381 (2003).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1439_CR3","first-page":"782","volume":"115","author":"R Koetter","year":"2003","unstructured":"Koetter R., M\u00e9dard M.: An algebraic approach to network coding. IEEE Trans. Info. Theory 115, 782\u2013795 (2003).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1439_CR4","doi-asserted-by":"publisher","first-page":"2745","DOI":"10.1109\/TIT.2005.851744","volume":"518","author":"R Dougherty","year":"2005","unstructured":"Dougherty R., Freiling C., Zeger K.: Insufficiency of linear coding in network information flow. IEEE Trans. Info. Theory 518, 2745\u20132759 (2005).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1439_CR5","first-page":"1","volume-title":"2011 IEEE Global Telecommunications Conference-GLOBECOM","author":"C Wang","year":"2011","unstructured":"Wang C., Gou T., Jafar S.A.: Multiple unicast capacity of 2-source 2-sink networks. In: 2011 IEEE Global Telecommunications Conference-GLOBECOM, pp. 1\u20135. IEEE, Houston (2011)."},{"doi-asserted-by":"crossref","unstructured":"Das A., Vishwanath S., Jafar S., Markopoulou A.: Network coding for multiple unicasts: an interference alignment approach. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 1878\u20131882. IEEE (2010).","key":"1439_CR6","DOI":"10.1109\/ISIT.2010.5513311"},{"doi-asserted-by":"crossref","unstructured":"Ramakrishnan A., Das A., Malek H., Markopoulou A., Jafar S., Vishwanath S.: Network coding for three unicast sessions: Interference alignment approaches. In: Proceedings of the 48th Annual Allerton Conference on Communication, Control, and Computing, pp. 1054\u20131061. IEEE (2010).","key":"1439_CR7","DOI":"10.1109\/ALLERTON.2010.5707026"},{"key":"1439_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.2018.2865936","volume":"631","author":"A Ravagnani","year":"2019","unstructured":"Ravagnani A., Kschischang F.R.: Adversarial network coding. IEEE Trans. Info. Theory 631, 198\u2013219 (2019).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1439_CR9","doi-asserted-by":"publisher","first-page":"3425","DOI":"10.1109\/TIT.2008.926344","volume":"548","author":"VR Cadambe","year":"2008","unstructured":"Cadambe V.R., Jafar S.A.: Interference alignment and the degrees of freedom of the $${K}$$-user interference channel. IEEE Trans. Info. Theory 548, 3425\u20133441 (2008).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1439_CR10","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1109\/COMST.2016.2547440","volume":"183","author":"N Zhao","year":"2016","unstructured":"Zhao N., Yu F.R., Jin M., Yan Q., Leung V.C.M.: Interference alignment and its applications: a survey, research issues, and challenges. IEEE Comm. Surv. Tut. 183, 1779\u20131803 (2016).","journal-title":"IEEE Comm. Surv. Tut."},{"doi-asserted-by":"crossref","unstructured":"Krishnamurthy S.R., Jafar S.A.: Precoding based network alignment and the capacity of a finite field channel. In: Proceedings 2003 IEEE International Symposium on Information Theory, pp. 2701\u20132705. IEEE (2013).","key":"1439_CR11","DOI":"10.1109\/ISIT.2013.6620717"},{"key":"1439_CR12","doi-asserted-by":"publisher","first-page":"4101","DOI":"10.1109\/TIT.2014.2321371","volume":"607","author":"SR Krishnamurthy","year":"2014","unstructured":"Krishnamurthy S.R., Jafar S.A.: On the capacity of the finite field counterparts of wireless interference networks. IEEE Trans. Info. Theory 607, 4101\u20134124 (2014).","journal-title":"IEEE Trans. Info. Theory"},{"key":"1439_CR13","doi-asserted-by":"publisher","first-page":"4902","DOI":"10.1109\/TIT.2014.2323234","volume":"608","author":"S-N Hong","year":"2014","unstructured":"Hong S.-N., Caire G.: On interference networks over finite fields. IEEE Trans. Info. Theory 608, 4902\u20134921 (2014).","journal-title":"IEEE Trans. Info. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01439-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01439-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01439-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,29]],"date-time":"2024-09-29T18:02:34Z","timestamp":1727632954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01439-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,10]]},"references-count":13,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1439"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01439-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,6,10]]},"assertion":[{"value":"15 September 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}