{"id":"https://openalex.org/W2112445009","doi":"https://doi.org/10.1109/isit.2012.6284114","title":"On modulo-sum computation over an erasure multiple access channel","display_name":"On modulo-sum computation over an erasure multiple access channel","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2112445009","doi":"https://doi.org/10.1109/isit.2012.6284114","mag":"2112445009"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6284114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},"type":"conference-paper","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/A5046253142","display_name":"Ashish Khisti","orcid":"https://orcid.org/0000-0002-2331-8965"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ashish Khisti","raw_affiliation_strings":["Electrical and Computer Engineering Department, University of Toronto, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, University of Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019551014","display_name":"Brett Hern","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brett Hern","raw_affiliation_strings":["Electrical and Computer Engineering Department, Texas A and M University, College Station, TX, USA","Electrical and Computer Engineering Dept., Texas A&M, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Electrical and Computer Engineering Dept., Texas A&M, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010169197","display_name":"Krishna R. Narayanan","orcid":"https://orcid.org/0000-0001-8742-5332"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Krishna Narayanan","raw_affiliation_strings":["Electrical and Computer Engineering Department, Texas A and M University, College Station, TX, USA","Electrical and Computer Engineering Dept., Texas A&M, College Station, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Electrical and Computer Engineering Department, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Electrical and Computer Engineering Dept., Texas A&M, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"57","issue":null,"first_page":"3013","last_page":"3017"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9995999932289124,"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/T12029","display_name":"DNA and Biological Computing","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.7542906999588013},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7180122137069702},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6000118851661682},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.587113618850708},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5854877233505249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.570784866809845},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5664340853691101},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.55832439661026},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.47446686029434204},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.43738532066345215},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.420097678899765},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4193674325942993},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4143393933773041},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37643998861312866},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.346262127161026},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.33549433946609497},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.27406686544418335},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.12776023149490356}],"concepts":[{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.7542906999588013},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7180122137069702},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6000118851661682},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.587113618850708},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5854877233505249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.570784866809845},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5664340853691101},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.55832439661026},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.47446686029434204},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.43738532066345215},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.420097678899765},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4193674325942993},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4143393933773041},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37643998861312866},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.346262127161026},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.33549433946609497},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.27406686544418335},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.12776023149490356},{"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/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2012.6284114","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6284114","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory 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":17,"referenced_works":["https://openalex.org/W1621123916","https://openalex.org/W1640197322","https://openalex.org/W2005196269","https://openalex.org/W2019307453","https://openalex.org/W2026641099","https://openalex.org/W2098192607","https://openalex.org/W2099111195","https://openalex.org/W2109053700","https://openalex.org/W2121714289","https://openalex.org/W2123973657","https://openalex.org/W2140227342","https://openalex.org/W2147355810","https://openalex.org/W2159622768","https://openalex.org/W2163384347","https://openalex.org/W2168920751","https://openalex.org/W2170678546","https://openalex.org/W6637029679"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2583282232","https://openalex.org/W2962908977","https://openalex.org/W2140357074","https://openalex.org/W2137028263","https://openalex.org/W2810502498","https://openalex.org/W2744779861","https://openalex.org/W2130518071","https://openalex.org/W3170346622","https://openalex.org/W2951344115"],"abstract_inverted_index":{"We":[0,117,178],"study":[1],"computation":[2],"of":[3,6,36,56,67,172],"a":[4,12,45,65,144,153,164,185],"modulo-sum":[5,35,66,125,203],"two":[7,38,69],"binary":[8,25],"source":[9],"sequences":[10],"over":[11],"two-user":[13],"erasure":[14,47,86,103],"multiple":[15,48],"access":[16,49],"channel.":[17,156],"Each":[18],"sender":[19],"observes":[20],"an":[21,85,102],"independent":[22,113],"and":[23,27,84,101,114,120,195],"equiprobable":[24],"sequence":[26,111],"the":[28,34,61,68,73,77,81,88,94,98,105,124,132,135,150,173,176,182,193,202],"receiver":[29],"is":[30,42,64,112,141,158,161,190],"interested":[31],"in":[32,54,159],"computing":[33],"these":[37],"sequences.":[39],"The":[40,108,138],"channel":[41,62,74],"modelled":[43],"as":[44],"binary-input,":[46],"channel,":[50],"which":[51],"can":[52,200],"be":[53],"one":[55,171],"three":[57],"states":[58],"-":[59],"either":[60,131],"output":[63,75],"input":[70,78,95],"symbols,":[71],"or":[72,91,134],"equals":[76,93],"symbol":[79,96],"on":[80,87,97,104,123],"first":[82,106],"link":[83,100],"second":[89,99],"link,":[90],"it":[92],"link.":[107],"associated":[109],"state":[110,188],"identically":[115],"distributed.":[116],"establish":[118,196],"upper":[119,139,166],"lower":[121],"bounds":[122],"capacity.":[126,204],"Our":[127],"coding":[128],"scheme":[129],"uses":[130],"compute-and-forward":[133],"decode-and-forward":[136],"techniques.":[137],"bound":[140,167],"obtained":[142,168],"by":[143,169],"genie":[145],"aided":[146],"argument":[147],"that":[148,197],"reduces":[149],"setup":[151],"to":[152,175,192],"compound":[154],"multiple-access":[155],"It":[157],"general":[160],"tighter":[162],"than":[163],"simple":[165],"revealing":[170],"messages":[174],"decoders.":[177],"also":[179],"briefly":[180],"consider":[181],"case":[183],"when":[184],"strictly":[186],"causal":[187],"feedback":[189,199],"available":[191],"encoders":[194],"such":[198],"increase":[201]},"counts_by_year":[{"year":2016,"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":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}