{"id":"https://openalex.org/W1485010915","doi":"https://doi.org/10.1109/isit.2008.4595318","title":"Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel","display_name":"Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W1485010915","doi":"https://doi.org/10.1109/isit.2008.4595318","mag":"1485010915"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4595318","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","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/A5032026808","display_name":"Igal Sason","orcid":"https://orcid.org/0000-0001-5681-1273"},"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":true,"raw_author_name":"Igal Sason","raw_affiliation_strings":["Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","Dept. of Electr. Eng. Technion, Technion-Israel Inst. of Technol., Haifa"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Dept. of Electr. Eng. Technion, Technion-Israel Inst. of Technol., Haifa","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075558357","display_name":"Gil Wiechman","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":"Gil Wiechman","raw_affiliation_strings":["Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","Dept. of Electr. Eng. Technion, Technion-Israel Inst. of Technol., Haifa"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Dept. of Electr. Eng. Technion, Technion-Israel Inst. of Technol., Haifa","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032026808"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.3812,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66312792,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"123","issue":null,"first_page":"1898","last_page":"1902"},"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.9987999796867371,"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.9965000152587891,"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.8636088371276855},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7849386930465698},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.6099392175674438},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6018027067184448},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5979107618331909},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5714733004570007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.55450838804245},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.5022835731506348},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4871539771556854},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46526622772216797},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4621954560279846},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46164172887802124},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.40539127588272095},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3199056088924408},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.31830036640167236},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.275235116481781},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09079664945602417},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07142284512519836}],"concepts":[{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.8636088371276855},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7849386930465698},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.6099392175674438},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6018027067184448},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5979107618331909},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5714733004570007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.55450838804245},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.5022835731506348},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4871539771556854},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46526622772216797},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4621954560279846},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46164172887802124},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.40539127588272095},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3199056088924408},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.31830036640167236},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.275235116481781},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09079664945602417},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07142284512519836},{"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/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":2,"locations":[{"id":"doi:10.1109/isit.2008.4595318","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595318","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.602.644","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.602.644","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://webee.technion.ac.il/people/sason/ISIT08_iterations.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W101784831","https://openalex.org/W1490125210","https://openalex.org/W1493541001","https://openalex.org/W1536930200","https://openalex.org/W1578462792","https://openalex.org/W2005328613","https://openalex.org/W2011891413","https://openalex.org/W2022381080","https://openalex.org/W2095882513","https://openalex.org/W2101394529","https://openalex.org/W2114468914","https://openalex.org/W2115104320","https://openalex.org/W2115228681","https://openalex.org/W2125259700","https://openalex.org/W2136307214","https://openalex.org/W2139769859","https://openalex.org/W2145714519","https://openalex.org/W2146712141","https://openalex.org/W2151296558","https://openalex.org/W2151937123","https://openalex.org/W2154502377","https://openalex.org/W2154734383","https://openalex.org/W2156055959","https://openalex.org/W2158511475","https://openalex.org/W2159059820","https://openalex.org/W2162764056","https://openalex.org/W2163706521","https://openalex.org/W2165573107","https://openalex.org/W2296125569","https://openalex.org/W2296600582","https://openalex.org/W2914980053","https://openalex.org/W3103206756","https://openalex.org/W4285719527","https://openalex.org/W4302493484","https://openalex.org/W6683321016"],"related_works":["https://openalex.org/W2139769859","https://openalex.org/W2139745099","https://openalex.org/W2140357074","https://openalex.org/W2127950068","https://openalex.org/W2002203372","https://openalex.org/W2502955786","https://openalex.org/W2583282232","https://openalex.org/W2028268383","https://openalex.org/W2372190485","https://openalex.org/W3103136794"],"abstract_inverted_index":{"We":[0],"derive":[1],"simple":[2],"lower":[3],"bounds":[4,34,51],"on":[5],"the":[6,16,37,43,50,77,89,92],"number":[7,78],"of":[8,56,79,91],"iterations":[9,80],"which":[10],"are":[11,24],"required":[12,81],"to":[13,36,47,53,96],"communicate":[14],"over":[15],"binary":[17],"erasure":[18],"channel":[19],"when":[20],"graph-based":[21],"code":[22],"ensembles":[23,55],"used":[25],"in":[26],"conjunction":[27],"with":[28],"an":[29],"iterative":[30],"message-passing":[31],"decoder.":[32],"These":[33],"refer":[35],"asymptotic":[38],"case":[39],"where":[40],"we":[41],"let":[42],"block":[44],"length":[45],"tend":[46],"infinity,":[48],"and":[49,65],"apply":[52],"general":[54],"low-":[57],"density":[58],"parity-check":[59],"(LDPC)":[60],"codes,":[61],"irregular":[62],"repeat-accumulate":[63],"(IRA)":[64],"accumulate-repeat-accumulate":[66],"(ARA)":[67],"codes.":[68],"It":[69],"is":[70],"demonstrated":[71],"that,":[72],"under":[73],"a":[74],"mild":[75],"condition,":[76],"for":[82],"successful":[83],"decoding":[84],"scales":[85],"at":[86],"least":[87],"like":[88],"inverse":[90],"gap":[93],"(in":[94],"rate)":[95],"capacity.":[97]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}