{"id":"https://openalex.org/W2151069418","doi":"https://doi.org/10.7907/gwdw-5h78.","title":"Network Coding and Distributed Compression over Large Networks: Some Basic Principles","display_name":"Network Coding and Distributed Compression over Large Networks: Some Basic Principles","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2151069418","doi":"https://doi.org/10.7907/gwdw-5h78.","mag":"2151069418"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.425.2337","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.425.2337","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://thesis.library.caltech.edu/7148/3/Bakshi-2012-thesis-updated.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5080893953","display_name":"Mayank Bakshi","orcid":"https://orcid.org/0000-0002-6051-923X","observed_orcids":["https://orcid.org/0000-0002-6051-923X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mayank Bakshi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5080893953"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9955999851226807,"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":0.9955999851226807,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.0013000000035390258,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.00039999998989515007,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/network-coding","display_name":"network coding","score":0.9459999799728394},{"id":"https://openalex.org/keywords/distributed-source-coding","display_name":"distributed source coding","score":0.8730000257492065},{"id":"https://openalex.org/keywords/capacity-bounds","display_name":"capacity bounds","score":0.531000018119812},{"id":"https://openalex.org/keywords/network-decomposition","display_name":"network decomposition","score":0.6389999985694885},{"id":"https://openalex.org/keywords/byzantine-adversaries","display_name":"Byzantine adversaries","score":0.9430000185966492},{"id":"https://openalex.org/keywords/limited-feedback","display_name":"limited feedback","score":0.6290000081062317},{"id":"https://openalex.org/keywords/side-information","display_name":"side information","score":0.7089999914169312},{"id":"https://openalex.org/keywords/multicast-networks","display_name":"multicast networks","score":0.7609999775886536},{"id":"https://openalex.org/keywords/rate-region","display_name":"rate region","score":0.38999998569488525}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8626812100410461},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6255466938018799},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5687589645385742},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.5290833115577698},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.4895111322402954},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.4623602032661438},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4522266685962677},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.43440529704093933},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.43353503942489624},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.4222310185432434},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.4157452881336212},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4076090157032013},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.37950998544692993},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.3170914351940155},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.27632540464401245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2608106732368469},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2309548258781433},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1612354815006256},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.425.2337","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.425.2337","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://thesis.library.caltech.edu/7148/3/Bakshi-2012-thesis-updated.pdf","raw_type":"text"},{"id":"mag:2151069418","doi":"https://doi.org/10.7907/gwdw-5h78.","is_oa":false,"landing_page_url":"http://thesis.library.caltech.edu/7148/3/Bakshi-2012-thesis-updated.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W29582038","https://openalex.org/W1829483414","https://openalex.org/W1974902810","https://openalex.org/W2002531683","https://openalex.org/W2013802416","https://openalex.org/W2014996477","https://openalex.org/W2026641099","https://openalex.org/W2041404167","https://openalex.org/W2048235391","https://openalex.org/W2054405836","https://openalex.org/W2060108852","https://openalex.org/W2062782005","https://openalex.org/W2071801393","https://openalex.org/W2088587246","https://openalex.org/W2095647873","https://openalex.org/W2099111195","https://openalex.org/W2099213070","https://openalex.org/W2105831729","https://openalex.org/W2107745473","https://openalex.org/W2108719798","https://openalex.org/W2117392366","https://openalex.org/W2119336214","https://openalex.org/W2119407552","https://openalex.org/W2127768309","https://openalex.org/W2128765501","https://openalex.org/W2136237463","https://openalex.org/W2142901448","https://openalex.org/W2146778221","https://openalex.org/W2150412388","https://openalex.org/W2150498905","https://openalex.org/W2152308050","https://openalex.org/W2157674959","https://openalex.org/W2159549640","https://openalex.org/W2164684058","https://openalex.org/W2167447263","https://openalex.org/W2171095166","https://openalex.org/W2171757833","https://openalex.org/W2172236196","https://openalex.org/W2296441616","https://openalex.org/W2488704916","https://openalex.org/W2552801970","https://openalex.org/W2913409262","https://openalex.org/W3103022991","https://openalex.org/W3216977419"],"related_works":["https://openalex.org/W29582038","https://openalex.org/W2157674959","https://openalex.org/W106926328","https://openalex.org/W3099995430","https://openalex.org/W2521433760","https://openalex.org/W2169194976","https://openalex.org/W7095344328","https://openalex.org/W2152308050","https://openalex.org/W2109958901","https://openalex.org/W7096126782"],"abstract_inverted_index":{"The":[0],"fields":[1],"of":[2,17,25,36,51,59,70,111,116,125,148,159,175,197,211,226,236,305],"Network":[3],"Coding":[4],"and":[5,121,154,199,242,252,273,285,298,356,359],"Distributed":[6],"Compression":[7],"have":[8,73],"focused":[9],"primarily":[10],"on":[11,118,255,362],"finding":[12],"the":[13,57,60,68,91,114,123,136,146,173,209,234,256,270,274,291,295,299,318,334,343,354,363],"capacity":[14,137,174],"for":[15,95,157,171,193,203,259,302,337,347,367],"families":[16],"problems":[18,100],"defined":[19],"by":[20,179,322],"either":[21],"a":[22,33,41,103,140,163,169,194,201,266],"broad":[23],"class":[24,35,196],"networks":[26,71,158,198,227,260,349],"topologies":[27],"(e.g.,":[28,38],"directed,":[29],"acyclic":[30],"networks)":[31,47],"under":[32,48],"narrow":[34],"demands":[37,52],"multicast),":[39],"or":[40,109],"specific":[42],"network":[43,97,104,108,151,178,182,214,244],"topology":[44],"(e.g.":[45,53],"three-node":[46],"different":[49],"types":[50],"Slepian-Wolf,":[54],"Ahlswede-Korner).":[55],"Given":[56],"difficulty":[58],"general":[61,96,250],"problem,":[62],"it":[63],"is":[64,79,191,310],"not":[65],"surprising":[66,308],"that":[67,72,181,188,228,230,264,311],"collection":[69,110],"been":[74],"fully":[75],"solved":[76],"to":[77,89,105,332],"date":[78],"still":[80],"very":[81,219],"small.":[82],"This":[83],"work":[84],"investigates":[85],"several":[86,224,303],"new":[87],"approaches":[88,132],"bounding":[90],"achievable":[92,119,237,345,364],"rate":[93,257,272,297,301,314,321,365],"region":[94,346,366],"source":[98,215,245,280],"coding":[99,152,156,216,246,281],"-":[101],"reducing":[102],"an":[106,176,323],"equivalent":[107],"networks,":[112],"investigating":[113],"effect":[115],"feedback":[117,212,231,263,275,284,300,315],"rates,":[120],"characterizing":[122],"role":[124,210],"side":[126,287,351],"information.":[127,339],"We":[129,186,222,248,340],"describe":[130],"two":[131],"aimed":[133],"at":[134,353],"simplifying":[135],"calculations":[138],"in":[139,213,239],"large":[141,195],"network.":[142],"First,":[143],"we":[144,167,289],"prove":[145],"optimality":[147],"separation":[149],"between":[150,269,294],"channel":[155],"point-to-point":[160],"channels":[161],"with":[162,261,282,350],"Byzantine":[164],"adversary.":[165],"Next,":[166],"give":[168,200],"strategy":[170,190],"calculating":[172],"error-free":[177],"decomposing":[180],"into":[183],"smaller":[184],"networks.":[185],"show":[187],"this":[189],"optimal":[192,319],"bound":[202],"other":[204,368],"cases.":[205],"To":[207],"date,":[208],"has":[217],"received":[218],"little":[220],"attention.":[221],"present":[223],"examples":[225],"demonstrate":[229,265],"can":[232,316,329],"increases":[233],"set":[235],"rates":[238,335],"both":[240],"lossy":[241],"lossless":[243],"settings.":[247],"derive":[249,290],"upper":[251,358],"lower":[253,360],"bounds":[254,361],"regions":[258],"limited":[262,283],"fundamental":[267],"tradeoff":[268,293],"forward":[271,296,320],"rate.":[276],"For":[277],"zero":[278,313],"error":[279],"decoder":[286],"information,":[288],"exact":[292,344],"classes":[304],"sources.":[306],"A":[307],"result":[309],"even":[312],"reduce":[317,333],"arbitrary":[324],"factor.":[325],"Side":[327],"information":[328,352],"be":[330],"used":[331],"required":[336],"reliable":[338],"precisely":[341],"characterize":[342],"multicast":[348],"sinks":[355],"find":[357],"demand":[369],"types.":[370]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2016-06-24T00:00:00"}