{"id":"https://openalex.org/W2133563496","doi":"https://doi.org/10.1109/icc.2004.1312511","title":"The all-zero iterative decoding algorithm for turbo code minimum distance computation","display_name":"The all-zero iterative decoding algorithm for turbo code minimum distance computation","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2133563496","doi":"https://doi.org/10.1109/icc.2004.1312511","mag":"2133563496"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2004.1312511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5090719949","display_name":"Roberto Garello","orcid":"https://orcid.org/0000-0003-0292-4648"},"institutions":[{"id":"https://openalex.org/I177477856","display_name":"Politecnico di Torino","ror":"https://ror.org/00bgk9508","country_code":"IT","type":"education","lineage":["https://openalex.org/I177477856"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"R. Garello","raw_affiliation_strings":["Politecnico di Turino, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Politecnico di Turino, Italy","institution_ids":["https://openalex.org/I177477856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090804355","display_name":"A. Vila-Casado","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Vila-Casado","raw_affiliation_strings":["University of California, Los Angeles, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"361","last_page":"364"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9965999722480774,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9907000064849854,"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/code-word","display_name":"Code word","score":0.7728098630905151},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7223103046417236},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7199113965034485},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5642893314361572},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5381916165351868},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5246298909187317},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5091220736503601},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4861154556274414},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4723205268383026},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.41269010305404663},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3234850764274597},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.11888039112091064}],"concepts":[{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7728098630905151},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7223103046417236},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7199113965034485},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5642893314361572},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5381916165351868},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5246298909187317},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5091220736503601},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4861154556274414},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4723205268383026},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.41269010305404663},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3234850764274597},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.11888039112091064},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2004.1312511","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2004.1312511","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577)","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":13,"referenced_works":["https://openalex.org/W1549149656","https://openalex.org/W1601842571","https://openalex.org/W2097876703","https://openalex.org/W2098553857","https://openalex.org/W2106912983","https://openalex.org/W2108593060","https://openalex.org/W2110505801","https://openalex.org/W2121606987","https://openalex.org/W2128765501","https://openalex.org/W2481373004","https://openalex.org/W2987657883","https://openalex.org/W6635797416","https://openalex.org/W6721540298"],"related_works":["https://openalex.org/W2139745099","https://openalex.org/W2127950068","https://openalex.org/W2015101254","https://openalex.org/W1782566311","https://openalex.org/W2114468163","https://openalex.org/W2132566027","https://openalex.org/W1989608637","https://openalex.org/W1968988046","https://openalex.org/W2373473769","https://openalex.org/W4439381"],"abstract_inverted_index":{"An":[0],"efficient":[1],"algorithm":[2,47,93,123,136,141],"for":[3,11,48],"turbo":[4,49],"code":[5,50,96],"minimum":[6,97],"distance":[7,51,98],"computation":[8],"is":[9,54],"essential":[10],"estimating":[12],"their":[13],"performance":[14],"in":[15,79],"the":[16,31,57,68,70,74,88,92,95,112,117,122,132,139],"error":[17,33],"floor":[18],"region":[19],"without":[20],"resorting":[21],"to":[22,116],"long":[23],"simulations.":[24],"Recently,":[25],"Berrou":[26],"et":[27],"al.":[28],"[1]":[29],"introduced":[30],"innovative":[32],"impulse":[34],"method,":[35],"based":[36,55],"on":[37,56,65],"iterative":[38,46,120],"decoding.":[39],"In":[40],"this":[41],"paper,":[42],"we":[43],"present":[44],"another":[45],"computation.":[52],"It":[53],"decoding":[58],"of":[59,67,119],"an":[60,143],"all-zero":[61,140],"received":[62],"sequence,":[63],"performed":[64],"half":[66],"code:":[69],"subset":[71],"containing":[72],"all":[73],"codewords":[75],"with":[76,102,131],"a":[77,80],"1":[78],"given":[81],"coordinate":[82],"i.":[83],"By":[84],"shifting":[85],"i":[86],"along":[87],"whole":[89],"codeword":[90],"length,":[91],"estimates":[94],"and":[99],"its":[100],"multiplicity":[101],"limited":[103],"complexity":[104],"O(k":[105],"<sup":[106],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[107],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[108],"),":[109],"k":[110],"being":[111],"interleaver":[113],"length.":[114],"Due":[115],"sub-optimality":[118],"decoding,":[121],"can":[124],"produce":[125],"false":[126],"results.":[127],"Investigation":[128],"by":[129],"comparison":[130],"exact":[133],"constrained":[134],"subcode":[135],"[2]":[137],"shows":[138],"possesses":[142],"excellent":[144],"reliability.":[145]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}