{"id":"https://openalex.org/W2156481894","doi":"https://doi.org/10.1109/isit.2009.5205334","title":"Stopping set analysis of repeat multiple-accumulate codes","display_name":"Stopping set analysis of repeat multiple-accumulate codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2156481894","doi":"https://doi.org/10.1109/isit.2009.5205334","mag":"2156481894"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00449558/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014522913","display_name":"Alexandre Graell i Amat","orcid":"https://orcid.org/0000-0002-5725-869X"},"institutions":[{"id":"https://openalex.org/I205703379","display_name":"Institut Mines-T\u00e9l\u00e9com","ror":"https://ror.org/025vp2923","country_code":"FR","type":"facility","lineage":["https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alexandre Graell i Amat","raw_affiliation_strings":["Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France","institution_ids":["https://openalex.org/I205703379"]}]},{"author_position":"last","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":"Eirik Rosnes","raw_affiliation_strings":["Depanment of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Depanment of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18285144,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1814","last_page":"1818"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9994000196456909,"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.9994000196456909,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9979000091552734,"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/T11130","display_name":"Coding theory and cryptography","score":0.9955000281333923,"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/code","display_name":"Code (set theory)","score":0.5962228775024414},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5278579592704773},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4843064844608307},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4522840678691864},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4438367486000061},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3931456506252289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38867083191871643}],"concepts":[{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5962228775024414},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5278579592704773},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4843064844608307},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4522840678691864},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4438367486000061},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3931456506252289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38867083191871643},{"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.2009.5205334","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00449558v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00449558","pdf_url":"https://hal.science/hal-00449558/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISIT'09: IEEE International Symposium on Information Theory, Jun 2009, S\u00e9oul, South Korea. pp.1814-1818, &#x27E8;10.1109/ISIT.2009.5205334&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00449558v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00449558","pdf_url":"https://hal.science/hal-00449558/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISIT'09: IEEE International Symposium on Information Theory, Jun 2009, S\u00e9oul, South Korea. pp.1814-1818, &#x27E8;10.1109/ISIT.2009.5205334&#x27E9;","raw_type":"Conference papers"},"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2156481894.pdf","grobid_xml":"https://content.openalex.org/works/W2156481894.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W2028640165","https://openalex.org/W2040058068","https://openalex.org/W2095882513","https://openalex.org/W2101394529","https://openalex.org/W2121606987","https://openalex.org/W2128765501","https://openalex.org/W2144420452","https://openalex.org/W2145714519","https://openalex.org/W2150824852","https://openalex.org/W2951752797","https://openalex.org/W2987657883","https://openalex.org/W3216695808","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2544423928","https://openalex.org/W2052122378","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2980963558","https://openalex.org/W2181413294","https://openalex.org/W2989452537"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,191],"consider":[4,144],"a":[5,21,37,44],"stopping":[6,54,65,80],"set":[7,55],"analysis":[8],"of":[9,20,76,125,140],"repeat":[10],"multiple-accumulate":[11],"(RMA)":[12],"code":[13,23,39,59,92,153],"ensembles":[14,60,93],"formed":[15],"by":[16],"the":[17,49,74,77,86,90,97,108,123,128,138,155,166,171,183,187,198],"serial":[18],"concatenation":[19],"repetition":[22],"with":[24,85,122,137,165],"multiple":[25],"accumulators.":[26,141],"The":[27],"RMA":[28,58,91],"codes":[29],"are":[30,94],"assumed":[31],"to":[32,107,170,196],"be":[33],"iteratively":[34],"decoded":[35],"in":[36,48],"constituent":[38,50],"oriented":[40],"fashion":[41],"using":[42],"maximum":[43],"posteriori":[45],"erasure":[46,99],"correction":[47],"codes.":[51],"We":[52,142],"give":[53,192],"enumerators":[56],"for":[57,96,150],"and":[61,147],"show":[62,148,197],"that":[63,149],"their":[64],"distance":[66,111],"h":[67,129,157],"<inf":[68,113,130,158,174],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[69,114,131,159,175],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">min</inf>":[70,115,132,160,176],",":[71,116,177],"defined":[72],"as":[73,186],"size":[75],"smallest":[78],"nonempty":[79],"set,":[81],"asymptotically":[82],"grows":[83],"linearly":[84,164],"block":[87,167],"length.":[88],"Thus,":[89],"good":[95],"binary":[98],"channel.":[100],"Furthermore,":[101],"it":[102],"is":[103],"shown":[104],"that,":[105],"contrary":[106,169],"asymptotic":[109,156,172],"minimum":[110],"d":[112,173],"whose":[117,178],"growth":[118,133,179],"rate":[119,134,180,188],"coefficient":[120,135,181],"increases":[121],"number":[124,139],"accumulate":[126],"codes,":[127],"diminishes":[136],"also":[143],"random":[145],"puncturing":[146],"sufficiently":[151],"high":[152],"rates,":[154],"does":[161],"not":[162],"grow":[163],"length,":[168],"approaches":[182],"Gilbert-Varshamov":[184],"bound":[185],"increases.":[189],"Finally,":[190],"iterative":[193],"decoding":[194],"thresholds":[195],"convergence":[199],"properties.":[200]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}
