{"id":"https://openalex.org/W2061445300","doi":"https://doi.org/10.1109/isit.2005.1523612","title":"Progressive d-separating edge set bounds on network coding rates","display_name":"Progressive d-separating edge set bounds on network coding rates","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2061445300","doi":"https://doi.org/10.1109/isit.2005.1523612","mag":"2061445300"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523612","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/A5047591578","display_name":"Gerhard Kramer","orcid":"https://orcid.org/0000-0002-3904-9181"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"G. Kramer","raw_affiliation_strings":["Bell Laboratories, Lucent Technologies, Inc., Murray Hill, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lucent Technologies, Inc., Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009369454","display_name":"Serap A. Savari","orcid":"https://orcid.org/0000-0002-7451-4392"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S.A. Savari","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047591578"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.855,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.91817809,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1588","last_page":"1592"},"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.9882000088691711,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9811999797821045,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.715900182723999},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.608018696308136},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5771450996398926},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5513970255851746},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5160176753997803},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5077968239784241},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4516642391681671},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4493100643157959},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44254499673843384},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4088563323020935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3921624720096588},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34522491693496704},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33147555589675903},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21664708852767944},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12491264939308167},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09024780988693237}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.715900182723999},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.608018696308136},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5771450996398926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5513970255851746},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5160176753997803},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5077968239784241},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4516642391681671},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4493100643157959},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44254499673843384},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4088563323020935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3921624720096588},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34522491693496704},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33147555589675903},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21664708852767944},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12491264939308167},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09024780988693237},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523612","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":17,"referenced_works":["https://openalex.org/W1489262227","https://openalex.org/W1912216824","https://openalex.org/W1964119857","https://openalex.org/W1976329386","https://openalex.org/W2017713020","https://openalex.org/W2099111195","https://openalex.org/W2105831729","https://openalex.org/W2121205191","https://openalex.org/W2129885443","https://openalex.org/W2137690813","https://openalex.org/W2150815458","https://openalex.org/W2156840794","https://openalex.org/W2159080219","https://openalex.org/W2340149117","https://openalex.org/W2564802890","https://openalex.org/W2574798017","https://openalex.org/W4297399141"],"related_works":["https://openalex.org/W2212571888","https://openalex.org/W2139379087","https://openalex.org/W2020805386","https://openalex.org/W2411336269","https://openalex.org/W2124128583","https://openalex.org/W2489403550","https://openalex.org/W2079655802","https://openalex.org/W2581667880","https://openalex.org/W2096444692","https://openalex.org/W2030487433"],"abstract_inverted_index":{"A":[0],"bound":[1,12,17,36],"on":[2,13,38],"network":[3,24],"coding":[4],"rates":[5],"is":[6,45,51],"developed":[7],"that":[8,49],"generalizes":[9],"an":[10],"edge-cut":[11],"routing":[14,50],"rates.":[15],"The":[16,35],"involves":[18],"progressively":[19],"removing":[20],"edges":[21],"from":[22],"a":[23],"graph":[25],"and":[26,42],"checking":[27],"whether":[28],"certain":[29],"strengthened":[30],"d-separation":[31],"conditions":[32],"are":[33],"satisfied.":[34],"improves":[37],"the":[39,59],"cut-set":[40],"bound,":[41],"its":[43],"efficacy":[44],"demonstrated":[46],"by":[47],"showing":[48],"rate-optimal":[52],"for":[53],"some":[54],"commonly":[55],"cited":[56],"examples":[57],"in":[58],"networking":[60],"literature":[61]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}