{"id":"https://openalex.org/W1997045285","doi":"https://doi.org/10.1109/itw.2011.6089518","title":"On the optimal block length for joint channel and network coding","display_name":"On the optimal block length for joint channel and network coding","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W1997045285","doi":"https://doi.org/10.1109/itw.2011.6089518","mag":"1997045285"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2011.6089518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","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/A5059543924","display_name":"Christian Koller","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Christian Koller","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 (USA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 (USA)","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003896287","display_name":"Martin Haenggi","orcid":"https://orcid.org/0000-0001-8547-0607"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Haenggi","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 (USA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 (USA)","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021311010","display_name":"J\u00f6rg Kliewer","orcid":"https://orcid.org/0000-0003-0942-8006"},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jorg Kliewer","raw_affiliation_strings":["Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA","Klipsch School of Electrical and Computer Engineering New Mexico State University, Las Cruces, NM 88003 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA","institution_ids":["https://openalex.org/I10052268"]},{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering New Mexico State University, Las Cruces, NM 88003 USA","institution_ids":["https://openalex.org/I10052268"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089062454","display_name":"Daniel J. Costello","orcid":"https://orcid.org/0000-0002-4387-116X"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel J. Costello","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 (USA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Electrical Engineering University of Notre Dame Notre Dame, IN 46556 (USA)","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2913,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.92004441,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"528","last_page":"532"},"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9825000166893005,"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/T12162","display_name":"Cellular Automata and Applications","score":0.953499972820282,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9111426472663879},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7008854150772095},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.6695064306259155},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.667963981628418},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.6174572110176086},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5782811641693115},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.5430135726928711},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5199238657951355},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4954754114151001},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.48577144742012024},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4701281487941742},{"id":"https://openalex.org/keywords/coding-tree-unit","display_name":"Coding tree unit","score":0.42671558260917664},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.3963606655597687},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.39193856716156006},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36717942357063293},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.29097771644592285},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2631675601005554},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.1275407075881958},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08412870764732361}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.9111426472663879},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7008854150772095},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.6695064306259155},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.667963981628418},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.6174572110176086},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5782811641693115},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.5430135726928711},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5199238657951355},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4954754114151001},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.48577144742012024},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4701281487941742},{"id":"https://openalex.org/C190750250","wikidata":"https://www.wikidata.org/wiki/Q13533439","display_name":"Coding tree unit","level":3,"score":0.42671558260917664},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3963606655597687},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.39193856716156006},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36717942357063293},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.29097771644592285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2631675601005554},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.1275407075881958},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08412870764732361},{"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/itw.2011.6089518","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089518","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","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":19,"referenced_works":["https://openalex.org/W1985399688","https://openalex.org/W2027130327","https://openalex.org/W2054120591","https://openalex.org/W2070609206","https://openalex.org/W2095194293","https://openalex.org/W2096667287","https://openalex.org/W2097651478","https://openalex.org/W2099521843","https://openalex.org/W2099805730","https://openalex.org/W2105831729","https://openalex.org/W2112588860","https://openalex.org/W2141768007","https://openalex.org/W2146397633","https://openalex.org/W2159169340","https://openalex.org/W2160475661","https://openalex.org/W2293000460","https://openalex.org/W2296125569","https://openalex.org/W3124613635","https://openalex.org/W4229922087"],"related_works":["https://openalex.org/W4312628177","https://openalex.org/W1579872668","https://openalex.org/W2123072960","https://openalex.org/W1587903609","https://openalex.org/W2668751350","https://openalex.org/W2148686647","https://openalex.org/W2156106714","https://openalex.org/W2586352442","https://openalex.org/W2161290246","https://openalex.org/W570222554"],"abstract_inverted_index":{"Channel":[0],"coding":[1,30,54,66,76,88,106,131,137,164],"alone":[2],"is":[3,27],"not":[4],"sufficient":[5],"to":[6,17,36,122,177,182],"reliably":[7],"transmit":[8],"a":[9,15,57,68,81,90,117,153],"message":[10,82],"of":[11,83,94,102,112,129,151,161,172,174],"finite":[12,91],"length":[13,84],"from":[14],"source":[16],"one":[18],"or":[19,50],"more":[20],"destinations.":[21,124],"To":[22],"ensure":[23],"that":[24,107],"no":[25],"data":[26],"lost,":[28],"channel":[29,65,71,155],"on":[31,56,67],"the":[32,99,109,126,135,149,159,169],"physical":[33],"layer":[34],"needs":[35],"be":[37],"combined":[38],"with":[39],"rateless":[40],"erasure":[41,78],"correcting":[42],"schemes":[43],"such":[44],"as":[45],"automatic":[46],"repeat":[47],"request":[48],"(ARQ)":[49],"random":[51,73],"linear":[52,74],"network":[53,75,87,105,130,163],"(RLNC)":[55],"higher":[58],"layer.":[59],"In":[60],"this":[61],"paper":[62],"we":[63,97,143],"consider":[64,115],"binary":[69],"symmetric":[70],"and":[72,86,120,134,168],"for":[77,104],"correction.":[79],"Given":[80],"K":[85],"over":[89,165],"Galois":[92],"field":[93,127],"size":[95,128],"q,":[96],"obtain":[98],"optimal":[100,170],"number":[101,111,171,173],"blocks":[103,140,167,175],"minimizes":[108],"expected":[110,136],"transmissions.":[113],"We":[114],"both":[116],"single":[118],"link":[119],"broadcast":[121],"n":[123],"As":[125],"gets":[132],"large":[133],"overhead":[138],"in":[139],"becomes":[141],"small,":[142],"show":[144],"that,":[145],"given":[146],"our":[147],"assumptions,":[148],"benefit":[150],"using":[152],"larger":[154],"coded":[156],"block":[157],"outweighs":[158],"advantage":[160],"employing":[162],"many":[166],"tends":[176],"one,":[178],"making":[179],"RLNC":[180],"equivalent":[181],"simple":[183],"ARQ.":[184]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}