{"id":"https://openalex.org/W2116464300","doi":"https://doi.org/10.1109/dcc.2004.1281527","title":"Heuristic search based soft-input soft-output decoding of arithmetic codes","display_name":"Heuristic search based soft-input soft-output decoding of arithmetic codes","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2116464300","doi":"https://doi.org/10.1109/dcc.2004.1281527","mag":"2116464300"},"language":"en","primary_location":{"id":"doi:10.1109/dcc.2004.1281527","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","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/A5100379998","display_name":"Yali Liu","orcid":"https://orcid.org/0000-0001-5174-2598"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yali Liu","raw_affiliation_strings":["Department of Electronics Engineering, Tsinghua University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics Engineering, Tsinghua University, Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103560215","display_name":"Jiangtao Wen","orcid":null},"institutions":[{"id":"https://openalex.org/I174015415","display_name":"Morpho (United States)","ror":"https://ror.org/05q5em355","country_code":"US","type":"company","lineage":["https://openalex.org/I174015415"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jiangtao Wen","raw_affiliation_strings":["Morphbius Technology, Inc., Ottawa, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Morphbius Technology, Inc., Ottawa, Canada","institution_ids":["https://openalex.org/I174015415"]}]}],"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":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.16711665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"551","last_page":"551"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9993000030517578,"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.9987000226974487,"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.9939000010490417,"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/decoding-methods","display_name":"Decoding methods","score":0.8116977214813232},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6951165795326233},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6630327701568604},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.5562919974327087},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5049677491188049},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4433290362358093},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4314934313297272},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4204736351966858},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4161831736564636},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.3924803137779236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23384863138198853},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1467946469783783}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8116977214813232},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6951165795326233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6630327701568604},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.5562919974327087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5049677491188049},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4433290362358093},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4314934313297272},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4204736351966858},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4161831736564636},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.3924803137779236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23384863138198853},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1467946469783783},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/dcc.2004.1281527","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dcc.2004.1281527","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Data Compression Conference, 2004. Proceedings. DCC 2004","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.143.6909","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.143.6909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csdl.computer.org/comp/proceedings/dcc/2004/2082/00/20820551.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.538.4196","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.538.4196","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.ucdavis.edu/~yliu/pub/papers/Tracy_DCC04.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2122674347","https://openalex.org/W2160645305","https://openalex.org/W6678455897"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2358427436","https://openalex.org/W1994919150","https://openalex.org/W4386269615","https://openalex.org/W2064794194","https://openalex.org/W2402589461","https://openalex.org/W4200104947","https://openalex.org/W58921990","https://openalex.org/W2808808802","https://openalex.org/W2204575588"],"abstract_inverted_index":{"The":[0],"paper":[1],"described":[2],"an":[3],"optimal":[4],"search":[5,10,41,85],"based":[6,11,28,79,86],"and":[7,17,21,54,95],"a":[8,33,39,89],"heuristic":[9,40,84],"decoding":[12],"algorithm":[13,87],"for":[14,47],"arithmetic":[15,80],"codes":[16],"compared":[18],"their":[19],"performance":[20,94],"complexity":[22],"with":[23],"the":[24,49,60,83],"traditional":[25,76],"\"hard\"":[26,77],"bit":[27],"AC":[29,37],"decoder.":[30],"To":[31],"approach":[32],"different":[34],"error":[35,65],"resilient":[36],"decoding,":[38],"algorithms":[42,73],"(HSAs)":[43],"in":[44],"artificial":[45],"intelligence":[46],"finding":[48],"minimal-weight":[50],"path":[51],"through":[52],"directed":[53],"nonnegatively-weighted":[55],"graphs":[56],"is":[57,62],"utilized":[58],"when":[59],"bitstream":[61],"transmitted":[63],"over":[64],"prone":[66],"channels.":[67],"Simulation":[68],"results":[69],"showed":[70],"that":[71],"both":[72],"easily":[74],"outperformed":[75],"bits":[78],"decoder,":[81],"while":[82],"achieved":[88],"very":[90],"good":[91],"tradeoff":[92],"between":[93],"complexity.":[96]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}