{"id":"https://openalex.org/W2745046354","doi":"https://doi.org/10.1109/isit.2017.8006938","title":"Role of feedback in modulo-sum computation over erasure multiple-access channels","display_name":"Role of feedback in modulo-sum computation over erasure multiple-access channels","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2745046354","doi":"https://doi.org/10.1109/isit.2017.8006938","mag":"2745046354"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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/A5080524212","display_name":"I-Hsiang Wang","orcid":"https://orcid.org/0000-0003-0695-5724"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"I-Hsiang Wang","raw_affiliation_strings":["Department of EE NTU, Taipei, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of EE NTU, Taipei, Taiwan","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114377379","display_name":"Shih\u2010Chun Lin","orcid":"https://orcid.org/0000-0001-6821-6893"},"institutions":[{"id":"https://openalex.org/I154864474","display_name":"National Taiwan University of Science and Technology","ror":"https://ror.org/00q09pe49","country_code":"TW","type":"education","lineage":["https://openalex.org/I154864474"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shih-Chun Lin","raw_affiliation_strings":["Department of ECE NTUST, Taipei, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of ECE NTUST, Taipei, Taiwan","institution_ids":["https://openalex.org/I154864474"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082244371","display_name":"Yu-Chih Huang","orcid":"https://orcid.org/0000-0003-2135-1232"},"institutions":[{"id":"https://openalex.org/I99613584","display_name":"National Taipei University","ror":"https://ror.org/03e29r284","country_code":"TW","type":"education","lineage":["https://openalex.org/I99613584"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yu-Chih Huang","raw_affiliation_strings":["Department of CE NTPU, Taipei, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of CE NTPU, Taipei, Taiwan","institution_ids":["https://openalex.org/I99613584"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080524212"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4144,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65815116,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2293","last_page":"2297"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994000196456909,"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":0.9994000196456909,"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.9993000030517578,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9991999864578247,"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/erasure","display_name":"Erasure","score":0.8250471949577332},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.76175457239151},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7112049460411072},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6078145503997803},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3977544903755188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.353374183177948},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34477710723876953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18675187230110168},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.18131470680236816},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12181413173675537}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.8250471949577332},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.76175457239151},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7112049460411072},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6078145503997803},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3977544903755188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.353374183177948},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34477710723876953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18675187230110168},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.18131470680236816},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12181413173675537}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8006938","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2018905248","https://openalex.org/W2096913515","https://openalex.org/W2140227342","https://openalex.org/W2165440928","https://openalex.org/W2551081444","https://openalex.org/W2745046354"],"related_works":["https://openalex.org/W2072016134","https://openalex.org/W2351168932","https://openalex.org/W2465690287","https://openalex.org/W2108143034","https://openalex.org/W2376389741","https://openalex.org/W1997850251","https://openalex.org/W2084549431","https://openalex.org/W913430005","https://openalex.org/W1509695971","https://openalex.org/W2117548279"],"abstract_inverted_index":{"The":[0,54,79],"problem":[1],"of":[2,6,21,50,96,117],"computing":[3],"the":[4,19,39,48,51,64,74,82,94,105,114,136,142,148],"modulo-sum":[5,125],"messages":[7,129],"over":[8],"a":[9,34,59],"finite-field":[10],"erasure":[11,76],"multiple":[12],"access":[13],"channel":[14],"(MAC)":[15],"is":[16,26,31,43,120,132],"studied,":[17],"and":[18,88],"role":[20],"feedback":[22,68],"for":[23,73],"function":[24],"computation":[25,41,71,107],"explored.":[27],"Our":[28],"main":[29],"contribution":[30],"two-fold.":[32],"First,":[33],"new":[35,55],"outer":[36,56],"bound":[37,57],"on":[38,93],"non-feedback":[40],"capacity":[42,72],"proved,":[44],"which":[45],"strictly":[46,69],"improves":[47],"state":[49,67,111],"art":[52],"[1].":[53],"answers":[58],"previously":[60],"unsettled":[61],"question":[62],"in":[63,133],"affirmative:":[65],"delayed":[66,110],"increases":[70],"two-user":[75],"MAC":[77],"universally.":[78],"proof":[80],"leverages":[81],"subset":[83],"entropy":[84],"inequality":[85],"by":[86,126],"Madiman":[87],"Tetali":[89],"[2].":[90],"Second,":[91],"focusing":[92],"family":[95,116],"linear":[97],"coding":[98],"schemes":[99],"with":[100,109],"hybrid-ARQ-type":[101],"retransmissions,":[102],"we":[103],"develop":[104],"optimal":[106],"rate":[108],"feedback.":[112],"For":[113],"considered":[115],"schemes,":[118],"it":[119],"always":[121],"sub-optimal":[122],"to":[123,135],"compute":[124],"decoding":[127],"all":[128],"first.":[130],"This":[131],"contrast":[134],"nonfeedback":[137],"case":[138],"[1]":[139],"where":[140],"sometimes":[141],"aforementioned":[143],"\u201cdecode-all\u201d":[144],"strategy":[145],"can":[146],"reach":[147],"best":[149],"known":[150],"achievable":[151],"rates.":[152]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}