{"id":"https://openalex.org/W3081454597","doi":"https://doi.org/10.1109/isit44484.2020.9174501","title":"Graceful degradation over the BEC via non-linear codes","display_name":"Graceful degradation over the BEC via non-linear codes","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3081454597","doi":"https://doi.org/10.1109/isit44484.2020.9174501","mag":"3081454597"},"language":"en","primary_location":{"id":"doi:10.1109/isit44484.2020.9174501","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174501","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/1721.1/137655","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5080988803","display_name":"Hajir Roozbehani","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hajir Roozbehani","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5031031216","display_name":"Yury Polyanskiy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yury Polyanskiy","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080988803"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1612,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.5382935,"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":"280","last_page":"285"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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.9973000288009644,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9951000213623047,"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/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6395857334136963},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5996667146682739},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5910837054252625},{"id":"https://openalex.org/keywords/generator-matrix","display_name":"Generator matrix","score":0.5547899007797241},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5233007073402405},{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.48470497131347656},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.48352670669555664},{"id":"https://openalex.org/keywords/bit-error-rate","display_name":"Bit error rate","score":0.45697224140167236},{"id":"https://openalex.org/keywords/luby-transform-code","display_name":"Luby transform code","score":0.44900190830230713},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4431534707546234},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.43358325958251953},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4238308370113373},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4157559275627136},{"id":"https://openalex.org/keywords/tornado-code","display_name":"Tornado code","score":0.4114694893360138},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4016115069389343},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3637952208518982},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.2993657886981964},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.2172413468360901},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.09196871519088745}],"concepts":[{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6395857334136963},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5996667146682739},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5910837054252625},{"id":"https://openalex.org/C1842014","wikidata":"https://www.wikidata.org/wiki/Q1502046","display_name":"Generator matrix","level":3,"score":0.5547899007797241},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5233007073402405},{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.48470497131347656},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.48352670669555664},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.45697224140167236},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.44900190830230713},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4431534707546234},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.43358325958251953},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4238308370113373},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4157559275627136},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.4114694893360138},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4016115069389343},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3637952208518982},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.2993657886981964},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.2172413468360901},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.09196871519088745},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit44484.2020.9174501","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174501","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/137655","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/137655","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"pmh:oai:dspace.mit.edu:1721.1/137655.2","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/137655.2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/137655","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/137655","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT web domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1494099594","https://openalex.org/W1536930200","https://openalex.org/W1974162859","https://openalex.org/W1974723335","https://openalex.org/W2041980892","https://openalex.org/W2052181759","https://openalex.org/W2090811717","https://openalex.org/W2114468914","https://openalex.org/W2625124615","https://openalex.org/W2793068283","https://openalex.org/W2886039423","https://openalex.org/W2887087447","https://openalex.org/W2962692598","https://openalex.org/W2975279124","https://openalex.org/W2991546740","https://openalex.org/W3013605664","https://openalex.org/W3101586883","https://openalex.org/W4300840296","https://openalex.org/W4301401949","https://openalex.org/W6771363266"],"related_works":["https://openalex.org/W1983975287","https://openalex.org/W1985033232","https://openalex.org/W2363930252","https://openalex.org/W2116479807","https://openalex.org/W3007776233","https://openalex.org/W2543719358","https://openalex.org/W2964159840","https://openalex.org/W2041319252","https://openalex.org/W2255365279","https://openalex.org/W4231546626"],"abstract_inverted_index":{"We":[0,113],"study":[1],"a":[2,9,118,181],"problem":[3],"of":[4,25,67,89,121,133,140,146,183,192,202],"constructing":[5],"codes":[6,32,74,101,203],"that":[7,104,115,149,170,196],"transform":[8],"channel":[10],"with":[11,19,33,110,117],"high":[12],"bit":[13],"error":[14],"rate":[15],"(BER)":[16],"into":[17],"one":[18,177],"low":[20],"BER":[21,37,174,184],"(at":[22],"the":[23,65,90,105,111,125,143,173,215,219],"expense":[24],"rate).":[26],"Our":[27],"focus":[28],"is":[29,94,108,195],"on":[30,84],"obtaining":[31],"smooth":[34],"(\u201cgraceful\u201d)":[35],"input-output":[36,127],"curves":[38,43,128],"(as":[39],"opposed":[40],"to":[41,53,96,200],"threshold-like":[42],"typical":[44],"for":[45,218],"long":[46],"error-correcting":[47],"codes).":[48],"This":[49,93],"paper":[50],"restricts":[51],"attention":[52],"binary":[54],"erasure":[55,178],"channels":[56],"(BEC)":[57],"and":[58,206,209],"contains":[59],"two":[60],"contributions.":[61],"First,":[62],"we":[63,164],"introduce":[64],"notion":[66],"Low":[68,97],"Density":[69,98],"Majority":[70],"Codes":[71],"(LDMCs).":[72],"These":[73],"are":[75,198],"non-linear":[76,207],"sparse-graph":[77],"codes,":[78],"which":[79],"output":[80],"majority":[81],"function":[82,107,182],"evaluated":[83],"randomly":[85],"chosen":[86],"small":[87],"subsets":[88],"data":[91],"bits.":[92],"similar":[95,211],"Generator":[99],"Matrix":[100],"(LDGMs),":[102],"except":[103],"XOR":[106],"replaced":[109],"majority.":[112],"show":[114],"even":[116],"few":[119],"iterations":[120,145],"belief":[122],"propagation":[123],"(BP)":[124],"attained":[126],"provably":[129],"improve":[130,152],"upon":[131],"performance":[132,153],"any":[134],"linear":[135],"systematic":[136,205],"code.":[137],"The":[138,189],"effect":[139],"nonlinearity":[141],"bootstraping":[142],"initial":[144],"BP,":[147],"suggests":[148],"LDMCs":[150],"should":[151],"in":[154],"various":[155],"applications":[156],"where":[157],"LDGMs":[158],"have":[159],"been":[160],"used":[161],"traditionally.":[162],"Second,":[163],"establish":[165],"several":[166],"two-point":[167],"converse":[168],"bounds":[169,194,212],"lower":[171],"bound":[172],"achievable":[175],"at":[176,186],"probability":[179],"as":[180],"achieved":[185],"another":[187],"one.":[188],"novel":[190],"nature":[191],"our":[193],"they":[197],"specific":[199],"subclasses":[201],"(linear":[204],"systematic)":[208],"outperform":[210],"implied":[213],"by":[214],"area":[216],"theorem":[217],"EXIT":[220],"function.":[221]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}