{"id":"https://openalex.org/W7124680818","doi":"https://doi.org/10.48550/arxiv.2601.10991","title":"Asymmetric Encoding-Decoding Schemes for Lossless Data Compression","display_name":"Asymmetric Encoding-Decoding Schemes for Lossless Data Compression","publication_year":2026,"publication_date":"2026-01-16","ids":{"openalex":"https://openalex.org/W7124680818","doi":"https://doi.org/10.48550/arxiv.2601.10991"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.10991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.10991","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.10991","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084723015","display_name":"H. Yamamoto","orcid":"https://orcid.org/0000-0001-6297-8838"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yamamoto, Hirosuke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5123307489","display_name":"Ken-ichi Iwata","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Iwata, Ken-ichi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9901000261306763,"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.9901000261306763,"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/T12162","display_name":"Cellular Automata and Applications","score":0.0017000000225380063,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.0010999999940395355,"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.9070000052452087},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.6809999942779541},{"id":"https://openalex.org/keywords/canonical-huffman-code","display_name":"Canonical Huffman code","score":0.6495000123977661},{"id":"https://openalex.org/keywords/prefix-code","display_name":"Prefix code","score":0.5490000247955322},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.5181000232696533},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.49390000104904175},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.4749999940395355},{"id":"https://openalex.org/keywords/universal-code","display_name":"Universal code","score":0.46369999647140503},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4569000005722046}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.9070000052452087},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.6809999942779541},{"id":"https://openalex.org/C115223089","wikidata":"https://www.wikidata.org/wiki/Q4885542","display_name":"Canonical Huffman code","level":5,"score":0.6495000123977661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6432999968528748},{"id":"https://openalex.org/C20079647","wikidata":"https://www.wikidata.org/wiki/Q1278039","display_name":"Prefix code","level":5,"score":0.5490000247955322},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5230000019073486},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.5181000232696533},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.49390000104904175},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.4749999940395355},{"id":"https://openalex.org/C197294415","wikidata":"https://www.wikidata.org/wiki/Q4176366","display_name":"Universal code","level":5,"score":0.46369999647140503},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4569000005722046},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.45680001378059387},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.41659998893737793},{"id":"https://openalex.org/C1769480","wikidata":"https://www.wikidata.org/wiki/Q1345239","display_name":"Entropy encoding","level":3,"score":0.4106000065803528},{"id":"https://openalex.org/C165021410","wikidata":"https://www.wikidata.org/wiki/Q55564","display_name":"Lossy compression","level":2,"score":0.3961000144481659},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3824000060558319},{"id":"https://openalex.org/C57890076","wikidata":"https://www.wikidata.org/wiki/Q4680725","display_name":"Adaptive coding","level":4,"score":0.367000013589859},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.3546000123023987},{"id":"https://openalex.org/C153338461","wikidata":"https://www.wikidata.org/wiki/Q2651","display_name":"Arithmetic coding","level":4,"score":0.353300005197525},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3368000090122223},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.3125999867916107},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3000999987125397},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3000999987125397},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.26570001244544983},{"id":"https://openalex.org/C94835093","wikidata":"https://www.wikidata.org/wiki/Q3113333","display_name":"Data compression ratio","level":5,"score":0.26339998841285706},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2605000138282776},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.10991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.10991","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.10991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.10991","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,21,34,96,106,117],"new":[4],"lossless":[5],"data":[6,35],"compression":[7],"coding":[8],"scheme":[9,14],"named":[10],"an":[11,87],"asymmetric":[12,28],"encoding-decoding":[13],"(AEDS),":[15],"which":[16,138],"can":[17,94],"be":[18],"considered":[19],"as":[20,64,169],"generalization":[22],"of":[23,27,71,79,108,135,152],"tANS":[24,157],"(tabled":[25],"variant":[26],"numeral":[29],"systems).":[30],"In":[31],"the":[32,61,65,68,72,80,102,109,112,131,136,142,148,153,163],"AEDS,":[33,137],"sequence":[36],"$\\mathbf{s}=s_1s_2\\cdots":[37],"s_n$":[38],"is":[39,50,74],"encoded":[40],"in":[41,52,60,111],"backward":[42],"order":[43,54],"$s_t,":[44,55],"t=n,":[45],"\\cdots,":[46,58],"2,1$,":[47],"while":[48],"$\\mathbf{s}$":[49],"decoded":[51],"forward":[53],"t=1,":[56],"2,":[57],"n$":[59],"same":[62],"way":[63],"tANS.":[66,81],"But,":[67],"code":[69,99,104,114,133,150],"class":[70],"AEDS":[73,88,155],"much":[75],"broader":[76],"than":[77,101,121],"that":[78,86,147],"We":[82],"show":[83,146],"for":[84,141],"i.i.d.~sources":[85],"with":[89,158,166],"2":[90],"states":[91,160],"(resp.~5":[92],"states)":[93],"attain":[95],"shorter":[97],"average":[98,132,149],"length":[100,134,151],"Huffman":[103,113],"if":[105],"child":[107],"root":[110],"tree":[115],"has":[116],"probability":[118],"weight":[119],"larger":[120],"0.61803":[122],"(resp.~0.56984).":[123],"Furthermore,":[124],"we":[125,145],"derive":[126],"several":[127],"upper":[128],"bounds":[129],"on":[130],"also":[139],"hold":[140],"tANS,":[143],"and":[144,156],"optimal":[154],"$N$":[159,170],"converges":[161],"to":[162],"source":[164],"entropy":[165],"speed":[167],"$O(1/N)$":[168],"increases.":[171]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-01-20T00:00:00"}