{"id":"https://openalex.org/W2132310838","doi":"https://doi.org/10.1109/isita.2010.5649637","title":"Path deletions for finite stack-size sequential-type decoding algorithms","display_name":"Path deletions for finite stack-size sequential-type decoding algorithms","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2132310838","doi":"https://doi.org/10.1109/isita.2010.5649637","mag":"2132310838"},"language":"en","primary_location":{"id":"doi:10.1109/isita.2010.5649637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isita.2010.5649637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Symposium On Information Theory & Its Applications","raw_type":"proceedings-article"},"type":"article","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/A5035196767","display_name":"Chenyi Wang","orcid":"https://orcid.org/0000-0003-0451-5346"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Chen-Yi Wang","raw_affiliation_strings":["Dept. of Elec. Eng., National Chiao-Tung Univ., Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Dept. of Elec. Eng., National Chiao-Tung Univ., Taiwan, R.O.C","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018784858","display_name":"Shin-Lin Shiehd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shin-Lin Shiehd","raw_affiliation_strings":["HT mMobile Inc., Hsin Chu Science Park, Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"HT mMobile Inc., Hsin Chu Science Park, Taiwan, R.O.C","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037230051","display_name":"Po\u2010Ning Chen","orcid":"https://orcid.org/0000-0002-1231-0706"},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Po-Ning Chen","raw_affiliation_strings":["Dept. of Elec. Eng., National Chiao-Tung Univ., Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Dept. of Elec. Eng., National Chiao-Tung Univ., Taiwan, R.O.C","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023807587","display_name":"Yunghsiang S. Han","orcid":"https://orcid.org/0000-0002-3592-1681"},"institutions":[{"id":"https://openalex.org/I154864474","display_name":"National Taiwan University of Science and Technology","ror":"https://ror.org/00q09pe49","country_code":"TW","type":"education","lineage":["https://openalex.org/I154864474"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yunghsiang S. Han","raw_affiliation_strings":["Dept. of Elec. Eng., National Taiwan Univ. of Sci. and Tech., Taiwan, R.O.C"],"affiliations":[{"raw_affiliation_string":"Dept. of Elec. Eng., National Taiwan Univ. of Sci. and Tech., Taiwan, R.O.C","institution_ids":["https://openalex.org/I154864474"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5035196767"],"corresponding_institution_ids":["https://openalex.org/I148366613"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1411517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"757","last_page":"761"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9994999766349792,"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.9994999766349792,"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.9983000159263611,"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/T12029","display_name":"DNA and Biological Computing","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7931613326072693},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7486811876296997},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6962387561798096},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6046088933944702},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6008182168006897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5890994071960449},{"id":"https://openalex.org/keywords/critical-path-method","display_name":"Critical path method","score":0.5335137844085693},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4641000032424927},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4446997046470642},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.20237314701080322},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.10705804824829102},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06686991453170776}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7931613326072693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7486811876296997},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6962387561798096},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6046088933944702},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6008182168006897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5890994071960449},{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.5335137844085693},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4641000032424927},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4446997046470642},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.20237314701080322},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.10705804824829102},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06686991453170776},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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":1,"locations":[{"id":"doi:10.1109/isita.2010.5649637","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isita.2010.5649637","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 International Symposium On Information Theory & Its Applications","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":9,"referenced_works":["https://openalex.org/W1972610228","https://openalex.org/W2035227369","https://openalex.org/W2087362480","https://openalex.org/W2099839668","https://openalex.org/W2122507038","https://openalex.org/W2131905190","https://openalex.org/W2148132507","https://openalex.org/W2151075895","https://openalex.org/W2152797116"],"related_works":["https://openalex.org/W4205451769","https://openalex.org/W3017203753","https://openalex.org/W2385322349","https://openalex.org/W2348545647","https://openalex.org/W2052976169","https://openalex.org/W2369600518","https://openalex.org/W2029144766","https://openalex.org/W2089275957","https://openalex.org/W2983681086","https://openalex.org/W2964031101"],"abstract_inverted_index":{"In":[0,91],"this":[1],"work,":[2],"we":[3,108],"focus":[4],"on":[5,10,72,116],"a":[6,21,117],"specific":[7],"practical":[8,22],"constraint":[9],"sequential-type":[11,53],"decoding":[12,43,54,59,94,119,140],"algorithms,":[13],"that":[14,28,56,68,161,182],"is,":[15],"finite":[16],"stack":[17,33,173],"size.":[18],"Under":[19],"such":[20],"constraint,":[23],"the":[24,32,83,93,101,104,123,127,133,138,143,149,153,162,166,172,184],"path":[25,49,69,112],"deletion":[26,50,70,113],"policy":[27],"is":[29,86,96,156,179],"required":[30],"when":[31,82],"exceeds":[34],"its":[35],"upper":[36],"limit":[37],"becomes":[38],"essential":[39],"in":[40,61,75,88,121,130,189],"performance":[41,81],"and":[42],"complexity.":[44],"We":[45],"then":[46],"examined":[47],"several":[48],"schemes":[51],"for":[52,135],"algorithms":[55],"can":[57,78,145],"produce":[58],"outputs":[60],"an":[62,110],"on-the-fly":[63],"fashion.":[64],"Our":[65],"result":[66],"indicates":[67],"based":[71,115],"Fano":[73,176],"metric":[74,177],"most":[76],"cases":[77],"achieve":[79],"better":[80],"memory":[84],"saving":[85],"critical":[87],"system":[89],"design.":[90],"case":[92],"process":[95],"allowed":[97],"to":[98],"start":[99],"after":[100],"reception":[102],"of":[103,132,137,152,165,183],"entire":[105],"received":[106],"word,":[107],"proposed":[109,188],"alternative":[111],"scheme":[114],"two-pass":[118,185],"structure,":[120],"which":[122],"backward":[124],"pass":[125,155,168],"estimates":[126],"heuristic":[128],"function":[129],"terms":[131],"M-algorithm":[134,144],"use":[136],"forward":[139,154,167],"search.":[141],"As":[142],"be":[146],"hardware-implemented,":[147],"only":[148,170],"computational":[150,163],"complexity":[151,164],"accounted.":[157],"Simulation":[158],"results":[159],"show":[160],"not":[169],"outperforms":[171],"algorithm":[174],"with":[175],"but":[178],"smaller":[180],"than":[181],"super-code":[186],"decoder":[187],"[9].":[190]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}