{"id":"https://openalex.org/W4248556524","doi":"https://doi.org/10.1109/isit.2004.1365246","title":"Capacity-achieving ensembles for the binary erasure channel with bounded complexity","display_name":"Capacity-achieving ensembles for the binary erasure channel with bounded complexity","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W4248556524","doi":"https://doi.org/10.1109/isit.2004.1365246"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5034247235","display_name":"H. Pfister","orcid":null},"institutions":[{"id":"https://openalex.org/I4210087596","display_name":"Qualcomm (United States)","ror":"https://ror.org/002zrf773","country_code":"US","type":"company","lineage":["https://openalex.org/I4210087596"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"H. Pfister","raw_affiliation_strings":["Qualcomm, Inc., CA, USA"],"affiliations":[{"raw_affiliation_string":"Qualcomm, Inc., CA, USA","institution_ids":["https://openalex.org/I4210087596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042985988","display_name":"I. Sason","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"I. Sason","raw_affiliation_strings":["Technion-Israel Institute of Technology, Haifa, Israel"],"affiliations":[{"raw_affiliation_string":"Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040790239","display_name":"R. Urbanke","orcid":null},"institutions":[{"id":"https://openalex.org/I4210158120","display_name":"Swiss Epilepsy Center","ror":"https://ror.org/05xnnea38","country_code":"CH","type":"other","lineage":["https://openalex.org/I4210158120"]},{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"R. Urbanke","raw_affiliation_strings":["EPF Lausanne, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPF Lausanne, Lausanne, Switzerland","institution_ids":["https://openalex.org/I4210158120","https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034247235"],"corresponding_institution_ids":["https://openalex.org/I4210087596"],"apc_list":null,"apc_paid":null,"fwci":1.6859,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.85217984,"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":"209","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9994000196456909,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9993000030517578,"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/binary-erasure-channel","display_name":"Binary erasure channel","score":0.8587774038314819},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7947498559951782},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.546224057674408},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5435798168182373},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.4937151372432709},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4901943802833557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4714580178260803},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4417574405670166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.409869521856308},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4071071147918701},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.39878344535827637},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3969278037548065},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3319892883300781},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10692843794822693},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07134678959846497}],"concepts":[{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.8587774038314819},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7947498559951782},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.546224057674408},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5435798168182373},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.4937151372432709},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4901943802833557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4714580178260803},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4417574405670166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.409869521856308},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4071071147918701},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.39878344535827637},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3969278037548065},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3319892883300781},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10692843794822693},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07134678959846497},{"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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2022381080","https://openalex.org/W2029712200","https://openalex.org/W2115228681","https://openalex.org/W2139769859","https://openalex.org/W2562965985","https://openalex.org/W6629343882"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2583282232","https://openalex.org/W2962908977","https://openalex.org/W2140357074","https://openalex.org/W2113562070","https://openalex.org/W2953350338","https://openalex.org/W2810502498","https://openalex.org/W2028268383","https://openalex.org/W2743670993","https://openalex.org/W4299127639"],"abstract_inverted_index":{"We":[0],"present":[1],"two":[2],"sequences":[3,41],"of":[4,6,39,42,52,55,72],"ensembles":[5,43],"nonsystematic":[7],"irregular":[8],"repeat-accumulate":[9],"codes":[10],"which":[11],"asymptotically":[12],"(as":[13],"their":[14],"block":[15],"length":[16],"tends":[17],"to":[18,35,58],"infinity)":[19],"achieve":[20],"capacity":[21],"on":[22],"the":[23,50,53,56,76,80],"binary":[24],"erasure":[25],"channel":[26],"(BEC)":[27],"with":[28],"bounded":[29,62],"complexity.":[30],"This":[31],"is":[32,65],"in":[33,75],"contrast":[34],"all":[36],"previous":[37],"constructions":[38],"capacity-achieving":[40],"whose":[44],"complexity":[45,63],"grows":[46],"at":[47],"least":[48],"like":[49],"log":[51],"inverse":[54],"gap":[57],"capacity.":[59],"The":[60],"new":[61],"result":[64],"achieved":[66],"by":[67],"allowing":[68],"a":[69],"sufficient":[70],"number":[71],"state":[73],"nodes":[74],"Tanner":[77],"graph":[78],"representing":[79],"codes.":[81]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}