{"id":"https://openalex.org/W2921786106","doi":"https://doi.org/10.23919/isita.2018.8664243","title":"A Consideration on Classification of Extended Binary Memoryless Sources Under Which Distinct Huffman Codes Are Constructed","display_name":"A Consideration on Classification of Extended Binary Memoryless Sources Under Which Distinct Huffman Codes Are Constructed","publication_year":2018,"publication_date":"2018-10-01","ids":{"openalex":"https://openalex.org/W2921786106","doi":"https://doi.org/10.23919/isita.2018.8664243","mag":"2921786106"},"language":"en","primary_location":{"id":"doi:10.23919/isita.2018.8664243","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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/A5012938108","display_name":"Nozomi Miya","orcid":null},"institutions":[{"id":"https://openalex.org/I131231118","display_name":"Aoyama Gakuin University","ror":"https://ror.org/002rw7y37","country_code":"JP","type":"education","lineage":["https://openalex.org/I131231118"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Nozomi Miya","raw_affiliation_strings":["Department of Electrical Engineering and Electronics, Aoyama Gakuin University, Sagamihara-shi, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Electronics, Aoyama Gakuin University, Sagamihara-shi, Japan","institution_ids":["https://openalex.org/I131231118"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022824333","display_name":"Takahiro Yoshida","orcid":"https://orcid.org/0000-0001-8741-5345"},"institutions":[{"id":"https://openalex.org/I4210124684","display_name":"Yokohama College of Commerce","ror":"https://ror.org/02s5d1b23","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210124684"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takahiro Yoshida","raw_affiliation_strings":["Faculty of Commerce, Yokohama College of Commerce, Yokohama-shi, Japan"],"affiliations":[{"raw_affiliation_string":"Faculty of Commerce, Yokohama College of Commerce, Yokohama-shi, Japan","institution_ids":["https://openalex.org/I4210124684"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012578290","display_name":"Hajime Jinushi","orcid":null},"institutions":[{"id":"https://openalex.org/I131231118","display_name":"Aoyama Gakuin University","ror":"https://ror.org/002rw7y37","country_code":"JP","type":"education","lineage":["https://openalex.org/I131231118"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hajime Jinushi","raw_affiliation_strings":["Department of Electrical Engineering and Electronics, Aoyama Gakuin University, Sagamihara-shi, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Electronics, Aoyama Gakuin University, Sagamihara-shi, Japan","institution_ids":["https://openalex.org/I131231118"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5012938108"],"corresponding_institution_ids":["https://openalex.org/I131231118"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19169514,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"540","last_page":"544"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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/T10627","display_name":"Advanced Image and Video Retrieval Techniques","score":0.9801999926567078,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9757999777793884,"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/huffman-coding","display_name":"Huffman coding","score":0.9824322462081909},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.6607983112335205},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6076858639717102},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.5986692309379578},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5493568181991577},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.5279903411865234},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5169240832328796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5125596523284912},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5039920210838318},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.5023097991943359},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.343189537525177},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3162902593612671},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.24168020486831665},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.1271427869796753},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.12046098709106445}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9824322462081909},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.6607983112335205},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6076858639717102},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.5986692309379578},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5493568181991577},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.5279903411865234},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5169240832328796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5125596523284912},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5039920210838318},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.5023097991943359},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.343189537525177},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3162902593612671},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.24168020486831665},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.1271427869796753},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.12046098709106445},{"id":"https://openalex.org/C70992990","wikidata":"https://www.wikidata.org/wiki/Q1681587","display_name":"Systematic code","level":4,"score":0.0},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/isita.2018.8664243","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita.2018.8664243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Symposium on Information Theory and Its Applications (ISITA)","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":5,"referenced_works":["https://openalex.org/W2145684344","https://openalex.org/W2478708596","https://openalex.org/W2905843968","https://openalex.org/W2920500492","https://openalex.org/W6757697679"],"related_works":["https://openalex.org/W4296567424","https://openalex.org/W4312409941","https://openalex.org/W2141317899","https://openalex.org/W1969741585","https://openalex.org/W2104740387","https://openalex.org/W3143996415","https://openalex.org/W2167474439","https://openalex.org/W2161708016","https://openalex.org/W2156745536","https://openalex.org/W2003530001"],"abstract_inverted_index":{"Distinct":[0],"Huffman":[1,62,75,92,122],"codes,":[2],"i.e.,":[3],"distinct":[4,61,91,121],"codeword":[5],"sets":[6],"obtained":[7],"by":[8],"Huffman's":[9],"algorithm":[10],"are":[11,94,113,133,135],"constructed":[12],"for":[13],"the":[14,38],"n-th":[15],"degree":[16],"extended":[17],"binary":[18],"memoryless":[19],"sources":[20],"whose":[21],"alphabet":[22],"is":[23],"{0,":[24],"1}":[25],"<sup":[26],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[27],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[28],"if":[29],"(n,":[30],"p)":[31],"varies,":[32],"where":[33],"p":[34,55],"\u2265":[35,48],"1/2":[36],"denotes":[37],"probability":[39],"that":[40],"symbol":[41],"0":[42],"occurs.":[43],"For":[44],"a":[45,57],"fixed":[46],"n":[47],"2,":[49],"sufficient":[50,82,111,131],"conditions":[51,68,83,105,112,117,132],"with":[52,69],"respect":[53,70],"to":[54,71,85,96,115,119,138],"constructing":[56,73],"part":[58],"of":[59],"all":[60,89],"codes":[63,76,93],"have":[64,77],"been":[65,79],"shown.":[66,80],"Necessary":[67],"p,":[72],"such":[74,90],"also":[78],"However,":[81],"corresponding":[84,118],"some":[86],"but":[87],"not":[88,110,136],"equivalent":[95,114,137],"necessary":[97,104,116,139],"conditions.":[98,140],"In":[99,124],"this":[100],"work,":[101],"we":[102,126],"tighten":[103],"and":[106],"discuss":[107],"whether":[108],"or":[109,134],"other":[120],"codes.":[123],"addition,":[125],"present":[127],"examples":[128],"in":[129],"which":[130]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}