{"id":"https://openalex.org/W2096365747","doi":"https://doi.org/10.1109/itcc.2003.1197533","title":"Direct Huffman coding and decoding using the table of code-lengths","display_name":"Direct Huffman coding and decoding using the table of code-lengths","publication_year":2004,"publication_date":"2004-05-13","ids":{"openalex":"https://openalex.org/W2096365747","doi":"https://doi.org/10.1109/itcc.2003.1197533","mag":"2096365747"},"language":"en","primary_location":{"id":"doi:10.1109/itcc.2003.1197533","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itcc.2003.1197533","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/A5086004026","display_name":"Reza Hashemian","orcid":"https://orcid.org/0000-0002-0028-7078"},"institutions":[{"id":"https://openalex.org/I102502594","display_name":"Northern Illinois University","ror":"https://ror.org/012wxa772","country_code":"US","type":"education","lineage":["https://openalex.org/I102502594"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Hashemian","raw_affiliation_strings":["Northern Illinois University, Dekalb, IL, USA","[Northern Illinois University, DeKalb, IL, USA]"],"affiliations":[{"raw_affiliation_string":"Northern Illinois University, Dekalb, IL, USA","institution_ids":["https://openalex.org/I102502594"]},{"raw_affiliation_string":"[Northern Illinois University, DeKalb, IL, USA]","institution_ids":["https://openalex.org/I102502594"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086004026"],"corresponding_institution_ids":["https://openalex.org/I102502594"],"apc_list":null,"apc_paid":null,"fwci":3.5976,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.93048507,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"237","last_page":"241"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","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/T10201","display_name":"Speech Recognition and Synthesis","score":0.9804999828338623,"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9783999919891357,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/huffman-coding","display_name":"Huffman coding","score":0.9818273186683655},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.9540987014770508},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8079671859741211},{"id":"https://openalex.org/keywords/tunstall-coding","display_name":"Tunstall coding","score":0.7830402255058289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6582516431808472},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.6436550617218018},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.552730917930603},{"id":"https://openalex.org/keywords/arithmetic-coding","display_name":"Arithmetic coding","score":0.4780633747577667},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4765342175960541},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.462909072637558},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4541184604167938},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.4445275664329529},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.34792453050613403},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33406904339790344},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3009088933467865},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.23476353287696838},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.23321670293807983},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22280234098434448},{"id":"https://openalex.org/keywords/context-adaptive-binary-arithmetic-coding","display_name":"Context-adaptive binary arithmetic coding","score":0.22275692224502563},{"id":"https://openalex.org/keywords/systematic-code","display_name":"Systematic code","score":0.11395305395126343},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.06892547011375427},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06738755106925964}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9818273186683655},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.9540987014770508},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8079671859741211},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.7830402255058289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6582516431808472},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.6436550617218018},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.552730917930603},{"id":"https://openalex.org/C153338461","wikidata":"https://www.wikidata.org/wiki/Q2651","display_name":"Arithmetic coding","level":4,"score":0.4780633747577667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4765342175960541},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.462909072637558},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4541184604167938},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.4445275664329529},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.34792453050613403},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33406904339790344},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3009088933467865},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.23476353287696838},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.23321670293807983},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22280234098434448},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.22275692224502563},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.11395305395126343},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.06892547011375427},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06738755106925964}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itcc.2003.1197533","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itcc.2003.1197533","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1523805883","https://openalex.org/W1984814295","https://openalex.org/W2018843564","https://openalex.org/W2060108852","https://openalex.org/W2128066268","https://openalex.org/W2129503320","https://openalex.org/W2136924094","https://openalex.org/W2143529460","https://openalex.org/W2145212047","https://openalex.org/W2154410785","https://openalex.org/W2166958782","https://openalex.org/W2171890523","https://openalex.org/W2895335898","https://openalex.org/W6631321384"],"related_works":["https://openalex.org/W2586352442","https://openalex.org/W2344988652","https://openalex.org/W2355839800","https://openalex.org/W3022794168","https://openalex.org/W2479819259","https://openalex.org/W2914103308","https://openalex.org/W4312628177","https://openalex.org/W2123072960","https://openalex.org/W3120020005","https://openalex.org/W1541694362"],"abstract_inverted_index":{"A":[0],"new":[1,38],"Huffman":[2,18,40,74],"coding":[3],"and":[4,56,62],"decoding":[5,35,57],"technique":[6,53],"is":[7,10,43,47],"presented.":[8],"There":[9],"no":[11],"need":[12],"to":[13,71],"construct":[14],"a":[15,37],"full":[16],"size":[17],"table":[19,31],"in":[20],"this":[21,52],"technique;":[22],"instead,":[23],"the":[24,30,63,72],"symbols":[25],"are":[26],"encoded":[27],"directly":[28],"from":[29],"of":[32],"code-lengths.":[33],"For":[34],"purposes":[36],"Condensed":[39],"Table":[41],"(CHT)":[42],"also":[44,66],"introduced.":[45],"It":[46],"shown":[48],"that":[49],"by":[50],"employing":[51],"both":[54],"encoding":[55],"operations":[58],"become":[59],"significantly":[60],"faster,":[61],"memory":[64],"consumption":[65],"becomes":[67],"much":[68],"smaller":[69],"compared":[70],"normal":[73],"coding/decoding.":[75]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}