{"id":"https://openalex.org/W2141106091","doi":"https://doi.org/10.1109/ciss.2011.5766234","title":"Fundamental bounds on the interconnect complexity of decoder implementations","display_name":"Fundamental bounds on the interconnect complexity of decoder implementations","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2141106091","doi":"https://doi.org/10.1109/ciss.2011.5766234","mag":"2141106091"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2011.5766234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2011.5766234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 45th Annual Conference on Information Sciences and Systems","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/A5054746425","display_name":"Pulkit Grover","orcid":"https://orcid.org/0000-0001-7651-7776"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pulkit Grover","raw_affiliation_strings":["USA","University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"USA","institution_ids":[]},{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079317491","display_name":"Anant Sahai","orcid":"https://orcid.org/0000-0001-9263-7719"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anant Sahai","raw_affiliation_strings":["USA","University of California, Berkeley, Berkeley, United States"],"affiliations":[{"raw_affiliation_string":"USA","institution_ids":[]},{"raw_affiliation_string":"University of California, Berkeley, Berkeley, United States","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054746425"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":2.558,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.90328638,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"44","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987000226974487,"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/T11478","display_name":"Caching and Content Delivery","score":0.9825999736785889,"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/decoding-methods","display_name":"Decoding methods","score":0.831023097038269},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6211432814598083},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.6138074994087219},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6128256916999817},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5076102018356323},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46115779876708984},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.4414232671260834},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4263020157814026},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.41838011145591736},{"id":"https://openalex.org/keywords/soft-decision-decoder","display_name":"Soft-decision decoder","score":0.41492873430252075},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26930949091911316},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21655261516571045}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.831023097038269},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6211432814598083},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.6138074994087219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6128256916999817},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5076102018356323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46115779876708984},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.4414232671260834},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4263020157814026},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.41838011145591736},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.41492873430252075},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26930949091911316},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21655261516571045},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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":3,"locations":[{"id":"doi:10.1109/ciss.2011.5766234","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2011.5766234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 45th Annual Conference on Information Sciences and Systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.188.4100","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.188.4100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.berkeley.edu/%7Epulkit/files/WireLength.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.950.4608","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.950.4608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://users.ece.cmu.edu/%7Epgrover/files/WireLength.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1536930200","https://openalex.org/W1555869143","https://openalex.org/W1585714998","https://openalex.org/W1618499549","https://openalex.org/W1622420187","https://openalex.org/W1825164805","https://openalex.org/W1842460841","https://openalex.org/W1956090263","https://openalex.org/W1973712217","https://openalex.org/W1991470928","https://openalex.org/W1995875735","https://openalex.org/W2006965300","https://openalex.org/W2017271493","https://openalex.org/W2018047324","https://openalex.org/W2046091144","https://openalex.org/W2051411864","https://openalex.org/W2067002313","https://openalex.org/W2099643334","https://openalex.org/W2124450281","https://openalex.org/W2128765501","https://openalex.org/W2140817291","https://openalex.org/W2142901448","https://openalex.org/W2156437081","https://openalex.org/W2163963758","https://openalex.org/W2169732368","https://openalex.org/W2340787257","https://openalex.org/W2580476827","https://openalex.org/W3121094298","https://openalex.org/W3125530803","https://openalex.org/W3143002681","https://openalex.org/W4210551624","https://openalex.org/W6603727012","https://openalex.org/W6648095896","https://openalex.org/W6678839936","https://openalex.org/W6684073700","https://openalex.org/W6731813352"],"related_works":["https://openalex.org/W2479327835","https://openalex.org/W2005341112","https://openalex.org/W2370232613","https://openalex.org/W2150639697","https://openalex.org/W2602611185","https://openalex.org/W2148630017","https://openalex.org/W2143011401","https://openalex.org/W4205295586","https://openalex.org/W2110972223","https://openalex.org/W2163036861"],"abstract_inverted_index":{"Modern":[0],"codes":[1,19],"are":[2,20,62],"often":[3,21],"designed":[4,22],"to":[5,29,86,96],"attain":[6],"the":[7,31,52,87,90,100,114,120,123,130,143,160,163,168,183],"minimum":[8],"possible":[9],"error":[10],"probability":[11],"under":[12],"a":[13,45,106,110],"blocklength":[14],"constraint.":[15],"For":[16],"instance,":[17],"sparse-graph":[18,112],"aiming":[23],"for":[24,105,109,145],"large":[25],"girth":[26,121],"in":[27,51,79,119],"order":[28],"reduce":[30],"error-probability.":[32],"In":[33],"this":[34,82,98,126],"paper,":[35],"we":[36,138,173],"show":[37,58],"that":[38,104,179],"such":[39],"an":[40],"improved":[41],"performance":[42,161],"comes":[43],"at":[44,167],"fundamental":[46],"cost:":[47,99],"longer":[48],"interconnects":[49,61,67],"(wires)":[50],"decoding":[53,146,157],"circuit.":[54],"Recent":[55],"empirical":[56],"results":[57],"why":[59],"shorter":[60],"important:":[63],"decoders":[64],"with":[65],"short":[66],"can":[68],"have":[69],"significantly":[70],"smaller":[71],"power":[72,76,83],"consumption":[73],"because":[74],"significant":[75],"is":[77,84,136,152],"burned":[78],"wires,":[80],"and":[81,154,162],"proportional":[85],"length":[88],"of":[89,122,165],"wire.":[91],"We":[92],"derive":[93,139],"two":[94],"bounds":[95,141],"demonstrate":[97],"first":[101],"bound":[102,127,135],"shows":[103],"belief-propagation":[107],"decoder":[108],"linear":[111],"code,":[113],"wire-length":[115,144],"must":[116],"increase":[117],"exponentially":[118],"code.":[124],"While":[125],"depends":[128],"on":[129,142,182],"code":[131,148,177],"construction,":[132],"our":[133],"second":[134],"fundamental:":[137],"lower":[140],"any":[147,155],"(even":[149],"if":[150],"it":[151],"nonlinear)":[153],"message-passing":[156],"algorithm":[158],"given":[159],"number":[164],"clock-cycles":[166],"decoder.":[169],"Under":[170],"simplifying":[171],"assumptions,":[172],"discuss":[174],"novel":[175],"small-girth":[176],"constructions":[178],"provide":[180],"upper-bounds":[181],"required":[184],"interconnect-length.":[185]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}