{"id":"https://openalex.org/W3123138835","doi":"https://doi.org/10.1109/isit45174.2021.9517788","title":"Codes approaching the Shannon limit with polynomial complexity per information bit","display_name":"Codes approaching the Shannon limit with polynomial complexity per information bit","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3123138835","doi":"https://doi.org/10.1109/isit45174.2021.9517788","mag":"3123138835"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9517788","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2101.10145","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059701662","display_name":"Ilya Dumer","orcid":"https://orcid.org/0000-0002-0884-9389"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ilya Dumer","raw_affiliation_strings":["University of California,Riverside,USA","University of California, Riverside"],"affiliations":[{"raw_affiliation_string":"University of California,Riverside,USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"University of California, Riverside","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039905547","display_name":"Navid Gharavi","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Navid Gharavi","raw_affiliation_strings":["University of California,Riverside,USA","University of California, Riverside"],"affiliations":[{"raw_affiliation_string":"University of California,Riverside,USA","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"University of California, Riverside","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059701662"],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":0.1593,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48079428,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"238","last_page":"243"},"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/T10125","display_name":"Advanced Wireless Communication 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/T11130","display_name":"Coding theory and cryptography","score":0.9983000159263611,"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/noisy-channel-coding-theorem","display_name":"Noisy-channel coding theorem","score":0.7522066831588745},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6890112161636353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5946719646453857},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.545251190662384},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.5110369920730591},{"id":"https://openalex.org/keywords/bit-error-rate","display_name":"Bit error rate","score":0.4915378987789154},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.48469117283821106},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4842066764831543},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.479453444480896},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47406262159347534},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4726599454879761},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4466424882411957},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4392126798629761},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4164600968360901},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32905033230781555},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.3135538101196289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2700500786304474},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.14627277851104736},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.0735369622707367}],"concepts":[{"id":"https://openalex.org/C103073706","wikidata":"https://www.wikidata.org/wiki/Q2345282","display_name":"Noisy-channel coding theorem","level":5,"score":0.7522066831588745},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6890112161636353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5946719646453857},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.545251190662384},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.5110369920730591},{"id":"https://openalex.org/C56296756","wikidata":"https://www.wikidata.org/wiki/Q840922","display_name":"Bit error rate","level":3,"score":0.4915378987789154},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.48469117283821106},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4842066764831543},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.479453444480896},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47406262159347534},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4726599454879761},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4466424882411957},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4392126798629761},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4164600968360901},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32905033230781555},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.3135538101196289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2700500786304474},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.14627277851104736},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0735369622707367},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit45174.2021.9517788","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9517788","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2101.10145","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.10145","pdf_url":"https://arxiv.org/pdf/2101.10145","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":"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":null,"raw_type":"text"},{"id":"mag:3123138835","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/2101.10145.pdf","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},{"id":"doi:10.48550/arxiv.2101.10145","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2101.10145","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2101.10145","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.10145","pdf_url":"https://arxiv.org/pdf/2101.10145","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":"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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3123138835.pdf","grobid_xml":"https://content.openalex.org/works/W3123138835.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1545614041","https://openalex.org/W2025948462","https://openalex.org/W2031173376","https://openalex.org/W2056871913","https://openalex.org/W2084902290","https://openalex.org/W2099111195","https://openalex.org/W2103604544","https://openalex.org/W2127490352","https://openalex.org/W2143571610","https://openalex.org/W2150498905","https://openalex.org/W2245001294","https://openalex.org/W2566392544","https://openalex.org/W2570893422","https://openalex.org/W2591132373","https://openalex.org/W3005799687","https://openalex.org/W3009999666","https://openalex.org/W3138355547","https://openalex.org/W4300188436","https://openalex.org/W6635854575","https://openalex.org/W6792262127"],"related_works":["https://openalex.org/W3196445387","https://openalex.org/W1568267450","https://openalex.org/W2118420528","https://openalex.org/W2951729012","https://openalex.org/W1671971709","https://openalex.org/W2991546740","https://openalex.org/W2591132373","https://openalex.org/W3081454597","https://openalex.org/W2578448763","https://openalex.org/W2148599432","https://openalex.org/W2128372030","https://openalex.org/W2374812910","https://openalex.org/W1831230998","https://openalex.org/W2620273385","https://openalex.org/W1553930860","https://openalex.org/W2951723552","https://openalex.org/W2127490352","https://openalex.org/W2166781509","https://openalex.org/W2895735843","https://openalex.org/W2114449874"],"abstract_inverted_index":{"We":[0,100],"consider":[1],"codes":[2,16,34],"for":[3,26,44,95],"channels":[4],"with":[5,17,121],"extreme":[6],"noise":[7],"that":[8,106],"emerge":[9],"in":[10],"various":[11],"low-power":[12],"applications.":[13],"Simple":[14],"LDPC":[15,133],"parity":[18],"checks":[19],"of":[20,77,141,167,174],"weight":[21],"3":[22,55],"are":[23,86,92],"first":[24],"studied":[25],"any":[27,45,98,161],"code":[28,140],"dimension":[29],"m":[30,146,175,177],"\u2192":[31,147],"\u221e.":[32],"These":[33],"form":[35],"modulation":[36,59],"schemes:":[37],"they":[38,64],"improve":[39],"the":[40,70,164],"original":[41],"channel":[42],"outputs":[43],"SNR":[46,61,162],">":[47],"-6":[48],"dB":[49,56,169],"(per":[50],"information":[51,111,179],"bit)":[52],"and":[53,82,118,128,132,170],"gain":[54],"over":[57],"uncoded":[58],"as":[60],"grows.":[62],"However,":[63],"also":[65,101],"have":[66],"a":[67,103,138,142,149,157],"floor":[68],"on":[69],"output":[71],"bit":[72],"error":[73],"rate":[74],"(BER)":[75],"irrespective":[76],"their":[78],"length.":[79],"Tight":[80],"lower":[81],"upper":[83],"bounds,":[84],"which":[85],"virtually":[87],"identical":[88],"to":[89],"simulation":[90],"results,":[91],"then":[93],"obtained":[94],"BER":[96,159],"at":[97,160],"SNR.":[99],"study":[102],"combined":[104],"scheme":[105],"splits":[107],"<tex":[108,114],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[109,115],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m$</tex>":[110],"bits":[112],"into":[113],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$b$</tex>":[116],"blocks":[117],"protects":[119],"each":[120],"some":[122],"polar":[123,131,139],"code.":[124],"Decoding":[125],"moves":[126],"back":[127],"forth":[129],"between":[130],"codes,":[134],"every":[135],"time":[136],"using":[137],"higher":[143],"rate.":[144],"For":[145],"\u221eand":[148],"sufficiently":[150],"large":[151],"parameter":[152],"b,":[153],"this":[154],"design":[155],"yields":[156],"vanishing":[158],"above":[163],"Shannon":[165],"limit":[166],"-1.59":[168],"has":[171],"complexity":[172],"order":[173],"log":[176],"per":[178],"bit.":[180]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}