{"id":"https://openalex.org/W3135212956","doi":"https://doi.org/10.1109/jsait.2021.3103772","title":"Coded Computing via Binary Linear Codes: Designs and Performance Limits","display_name":"Coded Computing via Binary Linear Codes: Designs and Performance Limits","publication_year":2021,"publication_date":"2021-08-10","ids":{"openalex":"https://openalex.org/W3135212956","doi":"https://doi.org/10.1109/jsait.2021.3103772","mag":"3135212956"},"language":"en","primary_location":{"id":"doi:10.1109/jsait.2021.3103772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2021.3103772","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Selected Areas in Information Theory","raw_type":"journal-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2103.01503","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084796282","display_name":"Mahdi Soleymani","orcid":"https://orcid.org/0000-0002-5495-901X"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mahdi Soleymani","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA","\u2020University of Michigan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"\u2020University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088051341","display_name":"Mohammad Vahid Jamali","orcid":"https://orcid.org/0000-0002-5007-0221"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Vahid Jamali","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA","\u2020University of Michigan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"\u2020University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056299839","display_name":"Hessam Mahdavifar","orcid":"https://orcid.org/0000-0001-9021-1992"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hessam Mahdavifar","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA","\u2020University of Michigan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan at Ann Arbor, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"\u2020University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5084796282"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.16,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48967051,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":"3","first_page":"879","last_page":"892"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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.9998000264167786,"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.9997000098228455,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.6990668773651123},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5415565967559814},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.5244341492652893},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5148274302482605},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.504475474357605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44415390491485596},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43129199743270874},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4172842502593994},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4114842712879181},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3655945062637329},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35415446758270264},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.23280662298202515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22724300622940063},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15837064385414124}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6990668773651123},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5415565967559814},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.5244341492652893},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5148274302482605},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.504475474357605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44415390491485596},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43129199743270874},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4172842502593994},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4114842712879181},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3655945062637329},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35415446758270264},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.23280662298202515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22724300622940063},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15837064385414124},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/jsait.2021.3103772","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2021.3103772","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Journal on Selected Areas in Information Theory","raw_type":"journal-article"},{"id":"mag:3135212956","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2103.01503","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null}],"best_oa_location":{"id":"mag:3135212956","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2103.01503","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G4155322781","display_name":null,"funder_award_id":"CCF\u20131909771","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4472973140","display_name":null,"funder_award_id":"CCF\u20131763348","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7820553813","display_name":null,"funder_award_id":"CCF\u20131941633","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":79,"referenced_works":["https://openalex.org/W1500657154","https://openalex.org/W1523155625","https://openalex.org/W1539055682","https://openalex.org/W1545614041","https://openalex.org/W1606480398","https://openalex.org/W1760551737","https://openalex.org/W1903497807","https://openalex.org/W1983964956","https://openalex.org/W1995416687","https://openalex.org/W2020804487","https://openalex.org/W2025948462","https://openalex.org/W2030633623","https://openalex.org/W2066513831","https://openalex.org/W2081131431","https://openalex.org/W2107276343","https://openalex.org/W2119118829","https://openalex.org/W2121417875","https://openalex.org/W2125319092","https://openalex.org/W2130076109","https://openalex.org/W2131949172","https://openalex.org/W2149484623","https://openalex.org/W2150498905","https://openalex.org/W2152212524","https://openalex.org/W2156744031","https://openalex.org/W2157243803","https://openalex.org/W2268702383","https://openalex.org/W2556205507","https://openalex.org/W2588792098","https://openalex.org/W2589095445","https://openalex.org/W2589571058","https://openalex.org/W2591190829","https://openalex.org/W2591324491","https://openalex.org/W2592169574","https://openalex.org/W2593067933","https://openalex.org/W2604218357","https://openalex.org/W2745045892","https://openalex.org/W2784935051","https://openalex.org/W2787606899","https://openalex.org/W2906470669","https://openalex.org/W2914963584","https://openalex.org/W2922342388","https://openalex.org/W2958990012","https://openalex.org/W2963117124","https://openalex.org/W2963256807","https://openalex.org/W2963495956","https://openalex.org/W2963922724","https://openalex.org/W2963953036","https://openalex.org/W2964088343","https://openalex.org/W2964292940","https://openalex.org/W2964293057","https://openalex.org/W2964317445","https://openalex.org/W2993613295","https://openalex.org/W3005122631","https://openalex.org/W3006030847","https://openalex.org/W3007714448","https://openalex.org/W3009878528","https://openalex.org/W3009999666","https://openalex.org/W3022909171","https://openalex.org/W3035566662","https://openalex.org/W3080407940","https://openalex.org/W3080510098","https://openalex.org/W3080930655","https://openalex.org/W3086858324","https://openalex.org/W3098226281","https://openalex.org/W3104691194","https://openalex.org/W3111415751","https://openalex.org/W3113961955","https://openalex.org/W3124082353","https://openalex.org/W3125613934","https://openalex.org/W3127518390","https://openalex.org/W3127726618","https://openalex.org/W3135201777","https://openalex.org/W4247588434","https://openalex.org/W4285068601","https://openalex.org/W4301491118","https://openalex.org/W6631381304","https://openalex.org/W6639528875","https://openalex.org/W6678557272","https://openalex.org/W6752557422"],"related_works":["https://openalex.org/W3187534145","https://openalex.org/W3006030847","https://openalex.org/W3128587166","https://openalex.org/W1547086409","https://openalex.org/W3021619474","https://openalex.org/W2800805056","https://openalex.org/W3207459428","https://openalex.org/W1886578798","https://openalex.org/W2367772226","https://openalex.org/W2612841544","https://openalex.org/W2111571101","https://openalex.org/W2765614089","https://openalex.org/W2911295071","https://openalex.org/W1955139928","https://openalex.org/W2911439725","https://openalex.org/W2781719001","https://openalex.org/W3033613751","https://openalex.org/W2951896729","https://openalex.org/W2953360857","https://openalex.org/W2417152658"],"abstract_inverted_index":{"We":[0,65,174],"consider":[1],"the":[2,57,62,70,74,85,89,112,121,150,168,223,235,238,267,271],"problem":[3,71,86],"of":[4,61,72,78,87,92,94,196,200,222,237,262],"coded":[5,80,214],"distributed":[6,50,81,127,263],"computing":[7,82,128,232,264],"where":[8],"a":[9,16,67,79,177,247],"large":[10],"linear":[11,39,118,143,155],"computational":[12,63],"job,":[13],"such":[14],"as":[15,226,228],"matrix":[17],"multiplication,":[18],"is":[19,54,133],"divided":[20],"into":[21],"<inline-formula":[22,33,44,96,204],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[23,34,45,97,140,205],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[24,35,46,98,206],"<tex-math":[25,36,47,99,207],"notation=\"LaTeX\">$k$":[26],"</tex-math></inline-formula>":[27,38,49,101,210],"smaller":[28],"tasks,":[29],"encoded":[30],"using":[31,115],"an":[32],"notation=\"LaTeX\">$(n,k)$":[37],"code,":[40],"and":[41,84,120,194,212,230,250],"performed":[42],"over":[43,103,185,216],"notation=\"LaTeX\">$n$":[48,100],"nodes.":[51],"The":[52,253],"goal":[53],"to":[55],"reduce":[56],"average":[58,75],"execution":[59,76,113,123],"time":[60,77,114,124],"job.":[64],"provide":[66],"connection":[68],"between":[69],"characterizing":[73],"system":[83,129],"analyzing":[88],"error":[90],"probability":[91],"codes":[93,119,144,184],"length":[95],"used":[102],"erasure":[104,186],"channels.":[105,187],"Accordingly,":[106],"we":[107],"present":[108],"closed-form":[109],"expressions":[110],"for":[111,180],"binary":[116,142],"random":[117],"best":[122,151],"any":[125,154],"linear-coded":[126],"can":[130,160],"achieve.":[131],"It":[132],"also":[134,163],"shown":[135],"that":[136,145,153],"there":[137],"exist":[138],"<italic":[139],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">good</i>":[141],"not":[146],"only":[147,190],"attain":[148],"(asymptotically)":[149],"performance":[152,244],"code":[156],"(not":[157],"necessarily":[158],"binary)":[159],"achieve":[161],"but":[162],"are":[164],"numerically":[165],"stable":[166],"against":[167],"inevitable":[169],"rounding":[170],"errors":[171],"in":[172,241,256,270],"practice.":[173],"then":[175],"develop":[176],"low-complexity":[178,248],"algorithm":[179],"decoding":[181,249],"Reed-Muller":[182],"(RM)":[183],"Our":[188],"decoder":[189],"involves":[191],"additions,":[192],"subtractions,":[193],"inversion":[195],"relatively":[197],"small":[198],"matrices":[199],"dimensions":[201],"at":[202],"most":[203],"notation=\"LaTeX\">$\\log":[208],"n+1$":[209],",":[211],"enables":[213,259],"computation":[215,240],"real-valued":[217],"data.":[218],"Extensive":[219],"numerical":[220],"analysis":[221],"fundamental":[224],"results":[225],"well":[227],"RM-":[229],"polar-coded":[231],"schemes":[233],"demonstrate":[234],"excellence":[236],"RM-coded":[239],"achieving":[242],"close-to-optimal":[243],"while":[245],"having":[246],"explicit":[251],"construction.":[252],"proposed":[254],"framework":[255],"this":[257],"paper":[258],"efficient":[260],"designs":[261],"systems":[265],"given":[266],"rich":[268],"literature":[269],"channel":[272],"coding":[273],"theory.":[274]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}
