{"id":"https://openalex.org/W2565003026","doi":"https://doi.org/10.1109/isit.2004.1365150","title":"An analysis of blocking switches using error control codes","display_name":"An analysis of blocking switches using error control codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2565003026","doi":"https://doi.org/10.1109/isit.2004.1365150","mag":"2565003026"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365150","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5030047891","display_name":"C. Emre Koksal","orcid":"https://orcid.org/0000-0001-8463-4446"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C.E. Koksal","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sci., Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sci., Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030047891"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":0.2317,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67390486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"113","last_page":"113"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9941999912261963,"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/speedup","display_name":"Speedup","score":0.9502766728401184},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6742576360702515},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.6378817558288574},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5448983311653137},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.4465411603450775},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.42497098445892334},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.41948121786117554},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3966860771179199},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3947189748287201},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3645963966846466},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.2999093532562256},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14914950728416443},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.14452597498893738}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.9502766728401184},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6742576360702515},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.6378817558288574},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5448983311653137},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.4465411603450775},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.42497098445892334},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.41948121786117554},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3966860771179199},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3947189748287201},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3645963966846466},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.2999093532562256},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14914950728416443},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.14452597498893738}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365150","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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":7,"referenced_works":["https://openalex.org/W1576330500","https://openalex.org/W1594652978","https://openalex.org/W1607153847","https://openalex.org/W2103929632","https://openalex.org/W2115727218","https://openalex.org/W2132687150","https://openalex.org/W2247610168"],"related_works":["https://openalex.org/W2119135810","https://openalex.org/W2371167013","https://openalex.org/W1964096323","https://openalex.org/W2142293082","https://openalex.org/W2105471374","https://openalex.org/W2389914059","https://openalex.org/W2125977161","https://openalex.org/W2038505395","https://openalex.org/W2152583962","https://openalex.org/W2921624411"],"abstract_inverted_index":{"The":[0],"relation":[1],"between":[2,67,88],"the":[3,8,19,41,71,97,108,112],"degree":[4],"of":[5,10,21,43,73,92],"blocking":[6,15],"and":[7,29,33,70,90,111],"amount":[9],"resource":[11],"speedup":[12,61,89,99,122],"necessary":[13,98],"for":[14,78,100],"switches":[16,23,118],"to":[17,35,85,115],"possess":[18],"capabilities":[20],"nonblocking":[22,117],"is":[24],"studied":[25],"in":[26],"this":[27],"paper":[28],"considers":[30],"both":[31],"multicast":[32],"point":[34,36],"scenarios.":[37],"We":[38,63],"show":[39],"that":[40,45],"number":[42,91],"configurations":[44,69],"must":[46],"be":[47,55],"supported":[48],"by":[49],"a":[50,120],"switching":[51],"interconnection":[52],"fabric":[53],"can":[54],"significantly":[56],"reduced":[57],"even":[58],"with":[59,119],"small":[60],"values.":[62],"construct":[64,116],"an":[65],"analogy":[66],"switch":[68,93],"codewords":[72],"certain":[74],"error":[75],"control":[76],"codes":[77],"which":[79],"we":[80,102,123],"use":[81,103,124],"space":[82],"covering":[83],"ideas":[84],"derive":[86,96],"relations":[87],"configurations.":[94],"To":[95],"non-blocking,":[101],"two":[104],"sphere":[105],"packing":[106],"bounds:":[107],"hamming":[109],"bound":[110,114],"Gilbert-Varshamov":[113],"given":[121],"maximum":[125],"distance":[126],"separable":[127],"codes.":[128]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}