{"id":"https://openalex.org/W1930374644","doi":"https://doi.org/10.1109/itcc.2003.1197531","title":"Shortest synchronizing codewords of a binary Huffman equivalent code","display_name":"Shortest synchronizing codewords of a binary Huffman equivalent code","publication_year":2004,"publication_date":"2004-05-13","ids":{"openalex":"https://openalex.org/W1930374644","doi":"https://doi.org/10.1109/itcc.2003.1197531","mag":"1930374644"},"language":"en","primary_location":{"id":"doi:10.1109/itcc.2003.1197531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itcc.2003.1197531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing","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/A5107807758","display_name":"Yuh-Ming Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I193365169","display_name":"National Chi Nan University","ror":"https://ror.org/03ha6v181","country_code":"TW","type":"education","lineage":["https://openalex.org/I193365169"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Yuh-Ming Huang","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Taiwan","Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Taiwan#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Taiwan","institution_ids":["https://openalex.org/I193365169"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Taiwan#TAB#","institution_ids":["https://openalex.org/I193365169"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109910581","display_name":"Sheng-Chi Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I193365169","display_name":"National Chi Nan University","ror":"https://ror.org/03ha6v181","country_code":"TW","type":"education","lineage":["https://openalex.org/I193365169"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Sheng-Chi Wu","raw_affiliation_strings":["Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Taiwan","Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Taiwan#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Taiwan","institution_ids":["https://openalex.org/I193365169"]},{"raw_affiliation_string":"Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Taiwan#TAB#","institution_ids":["https://openalex.org/I193365169"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107807758"],"corresponding_institution_ids":["https://openalex.org/I193365169"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.08102327,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"42","issue":null,"first_page":"226","last_page":"231"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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":1.0,"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.9891999959945679,"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.9769999980926514,"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/synchronizing","display_name":"Synchronizing","score":0.8814207911491394},{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.877765417098999},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.7726743817329407},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.6480549573898315},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5601943731307983},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.547420859336853},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5353894829750061},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.5207881331443787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5206812620162964},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.497997522354126},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.4135058522224426},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3807441294193268},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37708717584609985},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.27960753440856934},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.22210872173309326},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.20120403170585632},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17582175135612488},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.17129242420196533},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.1691986322402954},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.16414609551429749},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.1443231999874115},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12085425853729248}],"concepts":[{"id":"https://openalex.org/C162932704","wikidata":"https://www.wikidata.org/wiki/Q1058791","display_name":"Synchronizing","level":3,"score":0.8814207911491394},{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.877765417098999},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7726743817329407},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.6480549573898315},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5601943731307983},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.547420859336853},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5353894829750061},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.5207881331443787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5206812620162964},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.497997522354126},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.4135058522224426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3807441294193268},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37708717584609985},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.27960753440856934},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.22210872173309326},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.20120403170585632},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17582175135612488},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.17129242420196533},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.1691986322402954},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.16414609551429749},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.1443231999874115},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12085425853729248},{"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/itcc.2003.1197531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itcc.2003.1197531","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing","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":14,"referenced_works":["https://openalex.org/W1964565788","https://openalex.org/W1999953737","https://openalex.org/W2000856108","https://openalex.org/W2018843564","https://openalex.org/W2025930787","https://openalex.org/W2076540684","https://openalex.org/W2098942090","https://openalex.org/W2109512211","https://openalex.org/W2131600591","https://openalex.org/W2140165530","https://openalex.org/W2140264069","https://openalex.org/W2140384887","https://openalex.org/W2143529460","https://openalex.org/W2162115649"],"related_works":["https://openalex.org/W4237802754","https://openalex.org/W2166346116","https://openalex.org/W3022794168","https://openalex.org/W4296567424","https://openalex.org/W2344988652","https://openalex.org/W4312409941","https://openalex.org/W1969741585","https://openalex.org/W2104740387","https://openalex.org/W3143996415","https://openalex.org/W2161708016"],"abstract_inverted_index":{"The":[0],"inherent":[1],"problem":[2],"of":[3,17,48,71,85],"a":[4,10,32,49,58,72,89,94],"variable-length":[5],"code":[6,76,98],"is":[7,109],"that":[8],"even":[9],"single":[11],"bit":[12],"error":[13,23,41],"can":[14],"cause":[15],"loss":[16],"synchronization":[18],"and":[19,38,104],"may":[20],"lead":[21],"to":[22,34],"propagation.":[24,42],"Synchronizing":[25],"codewords":[26,108],"have":[27],"been":[28],"extensively":[29],"studies":[30],"as":[31],"mean":[33],"overcome":[35],"the":[36,46,65,69,83],"drawback":[37],"efficiently":[39],"stop":[40],"First":[43],"we":[44,63],"prove":[45],"restatement":[47],"result":[50],"originally":[51],"given":[52],"by":[53],"B.":[54],"Ruder":[55],"(1971)":[56],"in":[57],"more":[59],"straightforward":[60],"way.":[61],"Next,":[62],"present":[64],"necessary":[66],"conditions":[67],"for":[68,92],"existence":[70],"binary":[73,95],"Huffman":[74,96],"equivalent":[75,97],"with":[77,82,99],"shortest":[78,101],"synchronizing":[79,102,107],"codeword(s).":[80],"Finally,":[81],"help":[84],"derived":[86],"conditional":[87],"equations,":[88],"unified":[90],"approach":[91],"constructing":[93],"most":[100,105],"codeword(s)":[103],"other":[106],"proposed":[110],"also.":[111]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}