{"id":"https://openalex.org/W2136354965","doi":"https://doi.org/10.1109/itw.2005.1531863","title":"Iterative list decoding","display_name":"Iterative list decoding","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2136354965","doi":"https://doi.org/10.1109/itw.2005.1531863","mag":"2136354965"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2005.1531863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2005.1531863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Information Theory Workshop, 2005.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://orbit.dtu.dk/en/publications/0f7d33c0-8562-4302-8662-b39b8963ce95","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113536808","display_name":"J. Justesen","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"J. Justesen","raw_affiliation_strings":["Technical University of Denmark, Kongens Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061203057","display_name":"Tom H\u00f8holdt","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"T. Hoholdt","raw_affiliation_strings":["Department of Mathematics, Technical University of Denmark, Kongens Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025212826","display_name":"Johann Hjaltason","orcid":null},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"J. Hjaltason","raw_affiliation_strings":["Department of Mathematics, Technical University of Denmark, Kongens Lyngby, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Technical University of Denmark, Kongens Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2739,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6802972,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4 pp.","last_page":"4 pp."},"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/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9993000030517578,"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/decoding-methods","display_name":"Decoding methods","score":0.8779982328414917},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6595692038536072},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.614187479019165},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5802795886993408},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5702780485153198},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.546447217464447},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.5355302095413208},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.45881232619285583},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.44304946064949036},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4421304762363434},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.36755889654159546},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.33674031496047974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3266306519508362},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17196765542030334},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1525619924068451},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.08238813281059265}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8779982328414917},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6595692038536072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.614187479019165},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5802795886993408},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5702780485153198},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.546447217464447},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.5355302095413208},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.45881232619285583},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.44304946064949036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4421304762363434},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.36755889654159546},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.33674031496047974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3266306519508362},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17196765542030334},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1525619924068451},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.08238813281059265},{"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/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/itw.2005.1531863","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2005.1531863","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Information Theory Workshop, 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/0f7d33c0-8562-4302-8662-b39b8963ce95","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/0f7d33c0-8562-4302-8662-b39b8963ce95","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Justesen , J , H\u00f8holdt , T & Hjaltason , J 2005 , Iterative List Decoding . in Proceedings of Information Theory Workshop on Coding and Complexity . 2005 IEEE Information Theory Workshop , Roturua , New Zealand , 28/08/2005 . https://doi.org/10.1109/ITW.2005.1531863","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.atira.dk:publications/0f7d33c0-8562-4302-8662-b39b8963ce95","is_oa":true,"landing_page_url":"https://orbit.dtu.dk/en/publications/0f7d33c0-8562-4302-8662-b39b8963ce95","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Justesen , J , H\u00f8holdt , T & Hjaltason , J 2005 , Iterative List Decoding . in Proceedings of Information Theory Workshop on Coding and Complexity . 2005 IEEE Information Theory Workshop , Roturua , New Zealand , 28/08/2005 . https://doi.org/10.1109/ITW.2005.1531863","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1985800138","https://openalex.org/W2114869758","https://openalex.org/W2124113125"],"related_works":["https://openalex.org/W2537963609","https://openalex.org/W2092857423","https://openalex.org/W1650655882","https://openalex.org/W2126543779","https://openalex.org/W2361792238","https://openalex.org/W2169811229","https://openalex.org/W1482743218","https://openalex.org/W4225319325","https://openalex.org/W2182725540","https://openalex.org/W2167124952"],"abstract_inverted_index":{"We":[0],"analyze":[1],"the":[2,8,11,42,54,63],"relation":[3],"between":[4,35],"iterative":[5],"decoding":[6],"and":[7,39],"properties":[9],"of":[10,21,28,41,48],"extended":[12],"parity":[13],"check":[14],"matrix.":[15],"By":[16,44],"considering":[17],"a":[18,26,46],"modified":[19],"version":[20],"bit":[22],"flipping,":[23],"which":[24],"produces":[25],"list":[27],"decoded":[29],"words,":[30],"we":[31,57],"derive":[32],"several":[33],"relations":[34],"decodable":[36],"error":[37],"patterns":[38],"parameters":[40],"code.":[43,64],"developing":[45],"tree":[47],"codewords":[49],"at":[50],"minimal":[51],"distance":[52],"form":[53],"received":[55],"vector,":[56],"also":[58],"obtain":[59],"new":[60],"information":[61],"about":[62]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}