{"id":"https://openalex.org/W2743570548","doi":"https://doi.org/10.1109/isit.2017.8006616","title":"Scaling exponent of sparse random linear codes over binary erasure channels","display_name":"Scaling exponent of sparse random linear codes over binary erasure channels","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2743570548","doi":"https://doi.org/10.1109/isit.2017.8006616","mag":"2743570548"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006616","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006616","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/A5056299839","display_name":"Hessam Mahdavifar","orcid":"https://orcid.org/0000-0001-9021-1992"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hessam Mahdavifar","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056299839"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.8288,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76617739,"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":"689","last_page":"693"},"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.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/T11130","display_name":"Coding theory and cryptography","score":0.9986000061035156,"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/exponent","display_name":"Exponent","score":0.6978707909584045},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5363677144050598},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5210644602775574},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5082830786705017},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4747866988182068},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44628214836120605},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3780132532119751},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.25993475317955017},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.17855560779571533}],"concepts":[{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.6978707909584045},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5363677144050598},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5210644602775574},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5082830786705017},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4747866988182068},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44628214836120605},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3780132532119751},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.25993475317955017},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.17855560779571533},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8006616","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006616","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1597135703","https://openalex.org/W1651322423","https://openalex.org/W1858818897","https://openalex.org/W1999697648","https://openalex.org/W2036491047","https://openalex.org/W2106864314","https://openalex.org/W2145712176","https://openalex.org/W2150498905","https://openalex.org/W2162346886","https://openalex.org/W2169017678","https://openalex.org/W2185328402","https://openalex.org/W2566803863","https://openalex.org/W2742871150","https://openalex.org/W2963024103","https://openalex.org/W2963988569","https://openalex.org/W3102122722"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2970225200","https://openalex.org/W2065441244","https://openalex.org/W4293370477","https://openalex.org/W2015040128","https://openalex.org/W3197572193","https://openalex.org/W1979414196","https://openalex.org/W1981434583","https://openalex.org/W2016429737","https://openalex.org/W2990083380"],"abstract_inverted_index":{"The":[0,39,77,103,152],"problem":[1,160],"of":[2,8,48,61,65,106,144,154,182],"analyzing":[3],"the":[4,46,49,59,62,99,141,180,183,192,203],"finite-length":[5],"scaling":[6,63,150,168,200],"behavior":[7],"sparse":[9,83,108],"random":[10,19,50,67,84,109,122,145],"linear":[11,16,51,68,85,110,123,146],"codes":[12,17,86,111,147,165],"is":[13,42,98,112,132,140],"considered.":[14],"Random":[15],"with":[18,31,74,87,148,166,198],"generator":[20,193],"matrices":[21],"whose":[22],"entries":[23],"are":[24,36,79,170],"picked":[25],"according":[26],"to":[27,44,57,82,125,157,205],"i.i.d.":[28],"Bernoulli":[29],"distribution":[30],"parameter":[32,40],"q":[33,41,71,89,136],"=":[34,72,90,137],"o(1)":[35],"called":[37],"sparse.":[38],"referred":[43],"as":[45,179,191],"sparsity":[47,88,143],"code.":[52],"We":[53],"develop":[54],"a":[55,196],"methodology":[56],"show":[58],"optimality":[60],"exponent":[64,169],"uniform":[66,121],"codes,":[69,124],"i.e.,":[70],"1/2,":[73],"high":[75],"probability.":[76],"results":[78,156],"then":[80],"extended":[81],"\u0398(n":[91],"<sup":[92,116,127],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[93,117,128],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-1/2</sup>":[94],"),":[95,119],"where":[96],"n":[97],"code":[100,197],"block":[101],"length.":[102],"encoding":[104],"complexity":[105],"such":[107],"reduced":[113],"from":[114],"O(n":[115,126],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[118],"in":[120],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3/2</sup>":[129],").":[130],"It":[131],"also":[133,171],"conjectured":[134],"that":[135,178],"log":[138],"n/n":[139],"lowest":[142],"optimal":[149,167,199],"exponent.":[151],"connection":[153],"these":[155],"an":[158],"open":[159],"regarding":[161],"finding":[162],"binary":[163],"polar":[164],"discussed.":[172],"In":[173],"particular,":[174],"we":[175],"point":[176],"out":[177],"size":[181],"polarization":[184],"kernel":[185],"increases":[186],"it":[187],"can":[188],"be":[189],"used":[190],"matrix":[194],"for":[195],"exponent,":[201],"without":[202],"need":[204],"do":[206],"further":[207],"polarization.":[208]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}