{"id":"https://openalex.org/W2047776564","doi":"https://doi.org/10.1109/isit.2005.1523542","title":"Turbo stopping sets: the uniform interleaver and efficient enumeration","display_name":"Turbo stopping sets: the uniform interleaver and efficient enumeration","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2047776564","doi":"https://doi.org/10.1109/isit.2005.1523542","mag":"2047776564"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5090738616","display_name":"Eirik Rosnes","orcid":"https://orcid.org/0000-0001-8236-6601"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"E. Rosnes","raw_affiliation_strings":["The Selmer Center, Department of Informatics, University of Bergen, Bergen, Norway","Dept. of Inf., Bergen Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Selmer Center, Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"Dept. of Inf., Bergen Univ","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081966529","display_name":"\u00d8yvind Ytrehus","orcid":"https://orcid.org/0000-0001-5223-7577"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"O. Ytrehus","raw_affiliation_strings":["The Selmer Center, Department of Informatics, University of Bergen, Bergen, Norway","Dept. of Inf., Bergen Univ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Selmer Center, Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"Dept. of Inf., Bergen Univ","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3693,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84395394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1251","last_page":"1255"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9997000098228455,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.7926239967346191},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6212857961654663},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6190849542617798},{"id":"https://openalex.org/keywords/turbo-equalizer","display_name":"Turbo equalizer","score":0.5925981998443604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5778685808181763},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5693504810333252},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.5623137950897217},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5161515474319458},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.4767932891845703},{"id":"https://openalex.org/keywords/turbo","display_name":"Turbo","score":0.44317394495010376},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4295310378074646},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.42190021276474},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.376775860786438},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3343013823032379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30946314334869385},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30771058797836304},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.26088035106658936},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21606191992759705},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.16916179656982422},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10412001609802246},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.05967983603477478}],"concepts":[{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.7926239967346191},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6212857961654663},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6190849542617798},{"id":"https://openalex.org/C12232224","wikidata":"https://www.wikidata.org/wiki/Q7853840","display_name":"Turbo equalizer","level":5,"score":0.5925981998443604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5778685808181763},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5693504810333252},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5623137950897217},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5161515474319458},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.4767932891845703},{"id":"https://openalex.org/C2776240298","wikidata":"https://www.wikidata.org/wiki/Q1138513","display_name":"Turbo","level":2,"score":0.44317394495010376},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4295310378074646},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.42190021276474},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.376775860786438},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3343013823032379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30946314334869385},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30771058797836304},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.26088035106658936},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21606191992759705},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.16916179656982422},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10412001609802246},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.05967983603477478},{"id":"https://openalex.org/C171146098","wikidata":"https://www.wikidata.org/wiki/Q124192","display_name":"Automotive engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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":1,"locations":[{"id":"doi:10.1109/isit.2005.1523542","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523542","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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":8,"referenced_works":["https://openalex.org/W1606480398","https://openalex.org/W1977345138","https://openalex.org/W2095882513","https://openalex.org/W2100350887","https://openalex.org/W2109487231","https://openalex.org/W2110505801","https://openalex.org/W2121606987","https://openalex.org/W2155007889"],"related_works":["https://openalex.org/W2363507870","https://openalex.org/W2348997984","https://openalex.org/W1562642891","https://openalex.org/W2024764701","https://openalex.org/W2044606598","https://openalex.org/W2104409500","https://openalex.org/W3184754094","https://openalex.org/W2207102643","https://openalex.org/W2219893843","https://openalex.org/W2162180365"],"abstract_inverted_index":{"The":[0,72,97,133],"performance":[1],"of":[2,16,41,66,69,74,81,87,92,124,152],"turbo":[3,17,21,58,75,108,126,158],"decoding":[4,22,91],"on":[5,137],"the":[6,24,32,39,48,54,67,85,107,115,138],"binary":[7],"erasure":[8],"channel":[9],"(BEC)":[10],"can":[11],"be":[12],"characterized":[13],"in":[14,100,145,156],"terms":[15],"stopping":[18,59,76,82,109,127],"sets.":[19],"Apply":[20],"until":[23,31],"transmitted":[25],"codeword":[26],"has":[27],"been":[28],"recovered,":[29],"or":[30],"decoder":[33,49],"fails":[34],"to":[35,53,147],"progress":[36],"further.":[37],"Then":[38],"set":[40,60,68,110],"erased":[42,70],"positions":[43],"that":[44],"will":[45],"remain":[46],"when":[47],"stops":[50],"is":[51,62,78,135],"equal":[52],"unique":[55],"maximum":[56],"size":[57,111],"which":[61],"also":[63],"a":[64,130,157],"subset":[65],"positions.":[71],"concept":[73],"sets":[77,83,128],"an":[79,104,120,149],"adaptation":[80],"from":[84],"theory":[86],"iterative":[88],"belief-propagation":[89],"(BP)":[90],"low-density":[93],"parity-check":[94],"(LDPC)":[95],"codes.":[96],"main":[98],"results":[99],"this":[101],"work":[102],"are":[103],"expression":[105],"for":[106,129],"enumerating":[112],"function":[113],"under":[114],"uniform":[116],"interleaver":[117],"assumption,":[118],"and":[119],"efficient":[121],"enumeration":[122],"algorithm":[123,139],"small-size":[125],"particular":[131],"interleaver.":[132],"solution":[134],"based":[136],"proposed":[140],"by":[141],"Garello":[142],"et":[143],"al.":[144],"2001":[146],"compute":[148],"exhaustive":[150],"list":[151],"all":[153],"low-weight":[154],"codewords":[155],"code":[159]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}