{"id":"https://openalex.org/W2168769680","doi":"https://doi.org/10.1109/itw.2003.1216698","title":"Decoding M-binary turbo codes by the dual method","display_name":"Decoding M-binary turbo codes by the dual method","publication_year":2004,"publication_date":"2004-03-01","ids":{"openalex":"https://openalex.org/W2168769680","doi":"https://doi.org/10.1109/itw.2003.1216698","mag":"2168769680"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2003.1216698","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2003.1216698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-02786815/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086827489","display_name":"Yannick Saouter","orcid":"https://orcid.org/0000-0001-7980-9168"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Y. Saouter","raw_affiliation_strings":["T\u00e9l\u00e9communications de Bretagne, Technopole Brest-Iroise, Ecole Nationale Superieure d''Electronique et de ses Applications, Brest, France"],"affiliations":[{"raw_affiliation_string":"T\u00e9l\u00e9communications de Bretagne, Technopole Brest-Iroise, Ecole Nationale Superieure d''Electronique et de ses Applications, Brest, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086827489"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.1931886,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"74","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"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.9998000264167786,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9973999857902527,"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.8665028810501099},{"id":"https://openalex.org/keywords/bcjr-algorithm","display_name":"BCJR algorithm","score":0.7911010980606079},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.7840306162834167},{"id":"https://openalex.org/keywords/turbo-equalizer","display_name":"Turbo equalizer","score":0.726421058177948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6077015399932861},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5389007329940796},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5303120613098145},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4666315019130707},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4623730182647705},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.449789822101593},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4287378489971161},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4182930886745453},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3096166253089905},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2660517692565918},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10640308260917664}],"concepts":[{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.8665028810501099},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.7911010980606079},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.7840306162834167},{"id":"https://openalex.org/C12232224","wikidata":"https://www.wikidata.org/wiki/Q7853840","display_name":"Turbo equalizer","level":5,"score":0.726421058177948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6077015399932861},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5389007329940796},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5303120613098145},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4666315019130707},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4623730182647705},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.449789822101593},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4287378489971161},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4182930886745453},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3096166253089905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2660517692565918},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10640308260917664},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itw.2003.1216698","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2003.1216698","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-02786815v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02786815","pdf_url":"https://hal.science/hal-02786815/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":"Proceedings 2003 IEEE Information Theory Workshop, Mar 2003, Paris, France. pp.74-77, ⟨10.1109/ITW.2003.1216698⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-02786815v1","is_oa":true,"landing_page_url":"https://hal.science/hal-02786815","pdf_url":"https://hal.science/hal-02786815/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":"Proceedings 2003 IEEE Information Theory Workshop, Mar 2003, Paris, France. pp.74-77, ⟨10.1109/ITW.2003.1216698⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2168769680.pdf","grobid_xml":"https://content.openalex.org/works/W2168769680.grobid-xml"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1562979145","https://openalex.org/W2045407304","https://openalex.org/W2115198523","https://openalex.org/W2130515157","https://openalex.org/W2146694142","https://openalex.org/W2156214226","https://openalex.org/W2798333393","https://openalex.org/W4245808720","https://openalex.org/W6677449083","https://openalex.org/W7018733341","https://openalex.org/W7057610885"],"related_works":["https://openalex.org/W1847760306","https://openalex.org/W4230538726","https://openalex.org/W2124523850","https://openalex.org/W2168769680","https://openalex.org/W1520296533","https://openalex.org/W748999589","https://openalex.org/W2010879611","https://openalex.org/W2214047986","https://openalex.org/W2152502767","https://openalex.org/W1503126716"],"abstract_inverted_index":{"A":[0],"joint":[1],"effort":[2],"by":[3,23],"several":[4],"researchers":[5],"has":[6],"led":[7],"to":[8,30,35,49,56],"the":[9,24,36,47],"derivation":[10],"of":[11],"a":[12,14],"maximum":[13],"posteriori":[15],"decoding":[16],"algorithm":[17,28,39],"for":[18,40],"classical":[19,37],"binary":[20,42],"turbo":[21,43,51,59],"codes":[22,52],"dual":[25],"method.":[26],"This":[27],"leads":[29],"reduced":[31],"complexity":[32],"with":[33],"regard":[34],"MAP":[38],"high-rate":[41],"codes.":[44,60],"We":[45],"extend":[46],"result":[48],"duo-binary":[50],"and,":[53],"more":[54],"generally,":[55],"any":[57],"M-binary":[58]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}