{"id":"https://openalex.org/W2068736551","doi":"https://doi.org/10.1109/isit.2005.1523692","title":"Efficient network codes for cyclic networks","display_name":"Efficient network codes for cyclic networks","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2068736551","doi":"https://doi.org/10.1109/isit.2005.1523692","mag":"2068736551"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523692","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523692","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/A5057587867","display_name":"Elona Erez","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"E. Erez","raw_affiliation_strings":["Department of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv, Israel","Dept. of Electr. Eng., Tel-Aviv Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Tel-Aviv Univ.#TAB#","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066905280","display_name":"Meir Feder","orcid":"https://orcid.org/0000-0002-1290-0482"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"M. Feder","raw_affiliation_strings":["Department of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv, Israel","Dept. of Electr. Eng., Tel-Aviv Univ.#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering-Systems, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Tel-Aviv Univ.#TAB#","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057587867"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.5573,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.85705361,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1982","last_page":"1986"},"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.9846000075340271,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9708999991416931,"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/computer-science","display_name":"Computer science","score":0.7466400861740112},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7215539216995239},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.6174337863922119},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4911317527294159},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47550684213638306},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4644622206687927},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.45932528376579285},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4487447440624237},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.4187147915363312},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4169781804084778},{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.41179654002189636},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.22130945324897766},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20250603556632996},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09887304902076721}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7466400861740112},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7215539216995239},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.6174337863922119},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4911317527294159},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47550684213638306},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4644622206687927},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.45932528376579285},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4487447440624237},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.4187147915363312},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4169781804084778},{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.41179654002189636},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.22130945324897766},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20250603556632996},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09887304902076721},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523692","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523692","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1975442866","https://openalex.org/W2070745908","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2123562143","https://openalex.org/W2129060652","https://openalex.org/W2138928022","https://openalex.org/W2151959580","https://openalex.org/W2401610261","https://openalex.org/W6682228230"],"related_works":["https://openalex.org/W1966768284","https://openalex.org/W2141226803","https://openalex.org/W1972955796","https://openalex.org/W2978800595","https://openalex.org/W2219910205","https://openalex.org/W1541857863","https://openalex.org/W207048982","https://openalex.org/W2026651734","https://openalex.org/W2385427787","https://openalex.org/W2028287290"],"abstract_inverted_index":{"In":[0],"this":[1,133],"work":[2,126],"we":[3,115,121,134],"address":[4],"the":[5,52,77,82,85,90,94,117,129],"problem":[6],"of":[7,84],"network":[8,16,59],"codes":[9,17],"for":[10,21,54,127,139],"cyclic":[11,22,143],"networks.":[12,113],"We":[13,49,80],"show":[14,89],"that":[15,42,72],"can":[18],"be":[19],"constructed":[20],"networks":[23,144],"as":[24,26],"long":[25],"at":[27],"least":[28],"one":[29],"edge":[30,44],"in":[31,62,76,96,123],"each":[32],"cycle":[33],"has":[34],"a":[35,47,97],"delay,":[36,138],"but":[37],"it":[38,73],"is":[39,74,108],"not":[40],"required":[41],"every":[43],"would":[45],"have":[46],"delay.":[48],"then":[50],"present":[51],"algorithm":[53,120],"constructing":[55],"an":[56,124],"optimal":[57],"multicast":[58],"code,":[60],"developed":[61,122],"our":[63],"previous":[64],"work,":[65],"and":[66,88,142],"analyze":[67,135],"its":[68,136],"computational":[69],"complexity,":[70],"showing":[71],"polynomial":[75],"graph":[78],"size.":[79],"discuss":[81],"properties":[83],"resulting":[86,130],"codes,":[87],"ability":[91],"to":[92,111],"modify":[93],"code":[95],"localized":[98],"manner":[99],"when":[100],"sinks":[101],"are":[102],"added":[103],"or":[104],"removed.":[105],"This":[106],"property":[107],"also":[109],"applicable":[110],"acyclic":[112,141],"Finally,":[114],"propose":[116],"sequential":[118],"decoding":[119,128,137],"earlier":[125],"codes.":[131],"For":[132],"both":[140]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}