{"id":"https://openalex.org/W2561436563","doi":"https://doi.org/10.1109/isit.2005.1523335","title":"Insufficiency of linear coding in network information flow","display_name":"Insufficiency of linear coding in network information flow","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2561436563","doi":"https://doi.org/10.1109/isit.2005.1523335","mag":"2561436563"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523335","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005397048","display_name":"Randall Dougherty","orcid":"https://orcid.org/0000-0002-4129-1866"},"institutions":[{"id":"https://openalex.org/I4210157118","display_name":"CCI Reprographics (United States)","ror":"https://ror.org/04d7j1v83","country_code":"US","type":"company","lineage":["https://openalex.org/I4210157118"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Dougherty","raw_affiliation_strings":["Center for Communications Research, San Diego, CA, USA"],"affiliations":[{"raw_affiliation_string":"Center for Communications Research, San Diego, CA, USA","institution_ids":["https://openalex.org/I4210157118"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111639624","display_name":"C. Freiling","orcid":null},"institutions":[{"id":"https://openalex.org/I43369023","display_name":"California State University, San Bernardino","ror":"https://ror.org/02n651896","country_code":"US","type":"education","lineage":["https://openalex.org/I43369023"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Freiling","raw_affiliation_strings":["Department of Mathematics, California State University, San Bernardino, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, California State University, San Bernardino, CA, USA","institution_ids":["https://openalex.org/I43369023"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072111370","display_name":"K. Zeger","orcid":"https://orcid.org/0000-0001-6415-1447"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Zeger","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5005397048"],"corresponding_institution_ids":["https://openalex.org/I4210157118"],"apc_list":null,"apc_paid":null,"fwci":2.7358,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.91944876,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"264","last_page":"267"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9208999872207642,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/finite-field","display_name":"Finite field","score":0.8442022800445557},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.8319734334945679},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6679914593696594},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5527589917182922},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5393263101577759},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3354042172431946},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27152833342552185},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21698862314224243},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.177626371383667}],"concepts":[{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.8442022800445557},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8319734334945679},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6679914593696594},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5527589917182922},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5393263101577759},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3354042172431946},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27152833342552185},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21698862314224243},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.177626371383667},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523335","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2016444590","https://openalex.org/W2103320637","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2567286734","https://openalex.org/W3080929694","https://openalex.org/W6654396071","https://openalex.org/W6677426639","https://openalex.org/W6782648086"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2349952486","https://openalex.org/W1489260687","https://openalex.org/W2775700832","https://openalex.org/W2587222766","https://openalex.org/W3204670144","https://openalex.org/W2962934782","https://openalex.org/W2964326893","https://openalex.org/W1978343121","https://openalex.org/W2964302506"],"abstract_inverted_index":{"It":[0,20,66,185],"is":[1,21,160,179],"known":[2,23],"that":[3,24,70,97,152],"every":[4,71],"solvable":[5,41,72],"multicast":[6],"network":[7,73,100,124,154,159,178,206],"has":[8,55,67,74,101,111,125,207],"a":[9,14,56,75,89,99],"scalar":[10,45],"linear":[11,46,57,76,103,113,127,166,202,209],"solution":[12,47,58,77,104,114,128,210],"over":[13,48,78,105,115,169],"sufficiently":[15],"large":[16],"finite":[17,50,80,107,117,144,171],"field":[18,81,172],"alphabet.":[19],"also":[22,95],"this":[25,92,158],"result":[26],"does":[27],"not":[28,180],"generalize":[29],"to":[30,91],"arbitrary":[31],"networks.":[32],"There":[33],"are":[34],"several":[35],"examples":[36],"in":[37,130],"the":[38,131,153,164,177,205],"literature":[39],"of":[40,136,157,193],"networks":[42],"with":[43,120],"no":[44,102,112,126,208],"any":[49,106,116,170],"field.":[51],"However,":[52],"each":[53],"example":[54],"for":[59,189],"some":[60,79,84],"vector":[61,85],"dimension":[62],"greater":[63,162],"than":[64,163],"one.":[65],"been":[68],"conjectured":[69],"alphabet":[82],"and":[83,146],"dimension.":[86],"We":[87,94],"provide":[88],"counterexample":[90,123],"conjecture.":[93],"show":[96,151],"if":[98],"field,":[108],"then":[109],"it":[110],"commutative":[118],"ring":[119],"identity.":[121],"Our":[122],"even":[129,181,188],"more":[132,190],"general":[133,191],"algebraic":[134],"context":[135],"modules,":[137],"which":[138],"includes":[139],"as":[140,196],"special":[141],"cases":[142],"all":[143],"rings":[145],"Abelian":[147],"groups.":[148],"Furthermore,":[149],"we":[150],"coding":[155,167],"capacity":[156,168],"strictly":[161],"maximum":[165],"(exactly":[173],"10%":[174],"greater),":[175],"so":[176],"asymptotically":[182],"linearly":[183],"solvable.":[184],"follows":[186],"that,":[187],"versions":[192],"linearity":[194],"such":[195],"convolutional":[197],"coding,":[198,200],"filter-bank":[199],"or":[201],"time":[203],"sharing,":[204]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}