{"id":"https://openalex.org/W7134853419","doi":"https://doi.org/10.48550/arxiv.2603.08246","title":"Capacity of Non-Separable Networks with Restricted Adversaries","display_name":"Capacity of Non-Separable Networks with Restricted Adversaries","publication_year":2026,"publication_date":"2026-03-09","ids":{"openalex":"https://openalex.org/W7134853419","doi":"https://doi.org/10.48550/arxiv.2603.08246"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.08246","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042636612","display_name":"Christopher Hojny","orcid":"https://orcid.org/0000-0002-5324-8996"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hojny, Christopher","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063211750","display_name":"Altan B. K\u0131l\u0131\u00e7","orcid":"https://orcid.org/0000-0003-2925-6686"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"K\u0131l\u0131\u00e7, Altan B.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5095368705","display_name":"Sascha Kurz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kurz, Sascha","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5025356502","display_name":"Alberto Ravagnani","orcid":"https://orcid.org/0000-0001-5901-9484"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ravagnani, Alberto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22009851,"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.9914000034332275,"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.9914000034332275,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.003000000026077032,"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"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.0010999999940395355,"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/linear-network-coding","display_name":"Linear network coding","score":0.6022999882698059},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.49470001459121704},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.40849998593330383},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4000000059604645},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.39169999957084656},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.38999998569488525},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.37040001153945923},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.3659000098705292}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6022999882698059},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5397999882698059},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.49470001459121704},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4284000098705292},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41359999775886536},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.39169999957084656},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.38999998569488525},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.37040001153945923},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.3659000098705292},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.35920000076293945},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3411000072956085},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.3398999869823456},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.3199000060558319},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2948000133037567},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.29170000553131104},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.27950000762939453},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.26660001277923584}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.08246","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.08246","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.08246","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.08246","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,56],"paper":[1],"investigates":[2],"the":[3,13,19,48,52,62,84,91,98,110,149,155,165,169],"problem":[4],"of":[5,15,30,47,64,86,95,97,101,127,143,157,159],"single-source":[6],"multicasting":[7],"over":[8],"a":[9,27,44,124,141],"communication":[10],"network":[11,75,87],"in":[12,58,105,148],"presence":[14],"restricted":[16],"adversaries.":[17],"When":[18],"adversary":[20],"is":[21],"constrained":[22],"to":[23,163],"operate":[24],"only":[25],"on":[26,83],"prescribed":[28],"subset":[29],"edges,":[31],"classical":[32],"cut-set":[33],"bounds":[34,115],"are":[35],"no":[36],"longer":[37],"tight,":[38],"and":[39,51,107,134,168],"achieving":[40],"capacity":[41,68,94,137],"typically":[42],"requires":[43],"joint":[45],"design":[46],"outer":[49,80],"code":[50],"inner":[53],"(network)":[54],"code.":[55],"stands":[57],"sharp":[59],"contrast":[60],"with":[61,77,161],"case":[63],"unrestricted":[65],"adversaries,":[66],"where":[67],"can":[69],"be":[70],"achieved":[71],"by":[72],"combining":[73],"linear":[74],"coding":[76],"appropriate":[78],"rank-metric":[79],"codes.":[81],"Building":[82],"framework":[85],"decoding,":[88],"we":[89,108,122,153],"determine":[90],"exact":[92],"one-shot":[93],"one":[96],"fundamental":[99],"families":[100],"2-level":[102],"networks":[103,128,160],"introduced":[104],"[4],":[106],"improve":[109],"best":[111],"currently":[112],"known":[113,132],"lower":[114],"for":[116],"another":[117],"such":[118],"family.":[119],"In":[120],"addition,":[121],"introduce":[123],"new":[125],"family":[126],"that":[129,139,145],"generalizes":[130],"several":[131],"examples,":[133],"derive":[135],"partial":[136],"results":[138],"illustrate":[140],"variety":[142],"phenomena":[144],"arise":[146],"specifically":[147],"restricted-adversary":[150],"setting.":[151],"Finally,":[152],"investigate":[154],"concept":[156],"separability":[158],"respect":[162],"both":[164],"rank":[166],"metric":[167],"Hamming":[170],"metric.":[171]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-03-11T00:00:00"}