{"id":"https://openalex.org/W7160243914","doi":"https://doi.org/10.48550/arxiv.2605.01991","title":"Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels","display_name":"Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels","publication_year":2026,"publication_date":"2026-05-03","ids":{"openalex":"https://openalex.org/W7160243914","doi":"https://doi.org/10.48550/arxiv.2605.01991"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.01991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01991","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.01991","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135366451","display_name":"Vishnu Teja Kunde","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kunde, Vishnu Teja","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069801730","display_name":"Jean\u2010Fran\u00e7ois Chamberland","orcid":"https://orcid.org/0000-0002-2983-9884"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chamberland, Jean-Francois","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135391792","display_name":"Krishna R. Narayanan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Narayanan, Krishna R.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135353180","display_name":"Jamison Ebert","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ebert, Jamison","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"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.9742000102996826,"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.9742000102996826,"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.015799999237060547,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.0013000000035390258,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/huffman-coding","display_name":"Huffman coding","score":0.8127999901771545},{"id":"https://openalex.org/keywords/arithmetic-coding","display_name":"Arithmetic coding","score":0.6251999735832214},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.6035000085830688},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.47679999470710754},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.46000000834465027},{"id":"https://openalex.org/keywords/entropy-encoding","display_name":"Entropy encoding","score":0.4406999945640564},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.43790000677108765},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.43650001287460327},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4156999886035919}],"concepts":[{"id":"https://openalex.org/C46900642","wikidata":"https://www.wikidata.org/wiki/Q2647","display_name":"Huffman coding","level":3,"score":0.8127999901771545},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6780999898910522},{"id":"https://openalex.org/C153338461","wikidata":"https://www.wikidata.org/wiki/Q2651","display_name":"Arithmetic coding","level":4,"score":0.6251999735832214},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.607200026512146},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.6035000085830688},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.47679999470710754},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.46000000834465027},{"id":"https://openalex.org/C1769480","wikidata":"https://www.wikidata.org/wiki/Q1345239","display_name":"Entropy encoding","level":3,"score":0.4406999945640564},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.43790000677108765},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.43650001287460327},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4318000078201294},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4156999886035919},{"id":"https://openalex.org/C136695289","wikidata":"https://www.wikidata.org/wiki/Q415568","display_name":"Bitstream","level":3,"score":0.4016000032424927},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.38280001282691956},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.36399999260902405},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.35339999198913574},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.35089999437332153},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.34850001335144043},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.31540000438690186},{"id":"https://openalex.org/C19275194","wikidata":"https://www.wikidata.org/wiki/Q222903","display_name":"Multiplexing","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31360000371932983},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.31209999322891235},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.3084000051021576},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.30320000648498535},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C175732694","wikidata":"https://www.wikidata.org/wiki/Q1128713","display_name":"Context-adaptive binary arithmetic coding","level":3,"score":0.29170000553131104},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.2856999933719635},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.2784000039100647},{"id":"https://openalex.org/C2778192920","wikidata":"https://www.wikidata.org/wiki/Q16874989","display_name":"Signal compression","level":4,"score":0.27239999175071716},{"id":"https://openalex.org/C73231260","wikidata":"https://www.wikidata.org/wiki/Q7853376","display_name":"Tunstall coding","level":4,"score":0.27079999446868896},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.2549999952316284}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.01991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01991","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.01991","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.01991","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"},"sustainable_development_goals":[{"score":0.6699703931808472,"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Learning,":[0],"prediction,":[1],"and":[2,47,63,69,116,147,170,192],"compression":[3,149,155],"are":[4,42,104,163],"intimately":[5],"connected:":[6],"a":[7,16,22,38,50,53,84,94,173],"model":[8,87],"that":[9,27,81],"accurately":[10],"predicts":[11],"the":[12,61,66,71,78,90,125,137,157,190],"next":[13],"symbol":[14],"in":[15,184],"sequence":[17,28],"can":[18],"be":[19],"coupled":[20],"with":[21,143],"source":[23],"coder":[24,196],"to":[25,124],"compress":[26],"near":[29],"its":[30],"information-theoretic":[31],"limit.":[32],"When":[33],"tokenized":[34],"characters":[35],"arriving":[36],"at":[37,112,156],"fixed":[39],"reading":[40],"pace":[41],"encoded":[43],"into":[44],"variable-length":[45],"codewords":[46],"streamed":[48],"over":[49],"fixed-rate":[51],"channel,":[52],"queue":[54],"forms":[55],"whose":[56],"per-token":[57],"delay":[58,146],"depends":[59],"on":[60,70],"mean":[62],"variance":[64],"of":[65,159],"bit":[67],"lengths":[68],"coder's":[72],"algorithmic":[73,121,145],"latency.":[74],"This":[75,177],"paper":[76],"investigates":[77],"compression--delay":[79],"tradeoff":[80],"arises":[82],"when":[83],"causal":[85],"language":[86],"serves":[88],"as":[89,132],"sequential":[91],"predictor":[92],"within":[93],"predict-then-code":[95],"architecture":[96],"for":[97,140],"real-time":[98],"text":[99],"transmission.":[100],"Several":[101],"coding":[102,152],"schemes":[103],"compared:":[105],"Shannon":[106],"(ideal),":[107],"Huffman,":[108],"arithmetic":[109],"coding,":[110],"rANS":[111],"various":[113],"block":[114],"sizes,":[115],"gzip.":[117],"The":[118],"analysis":[119],"separates":[120],"delay,":[122,129],"inherent":[123],"coder,":[126],"from":[127],"computational":[128],"which":[130,195],"shrinks":[131],"hardware":[133],"improves.":[134],"Huffman":[135],"is":[136,197],"practical":[138],"choice":[139],"over-provisioned":[141],"channels,":[142],"zero":[144],"modest":[148],"overhead.":[150],"Arithmetic":[151],"achieves":[153],"near-optimal":[154],"cost":[158],"decodability":[160],"delay.":[161],"Findings":[162],"validated":[164],"across":[165],"two":[166],"scales:":[167],"GPT-2":[168],"(124M)":[169],"Llama~3.2":[171],"(3B),":[172],"twenty-five-fold":[174],"parameter":[175],"range.":[176],"scaling":[178],"yields":[179],"an":[180],"approximately":[181],"38\\%":[182],"reduction":[183],"bits":[185],"per":[186],"character,":[187],"effectively":[188],"over-provisioning":[189],"channel":[191],"thereby":[193],"changing":[194],"optimal.":[198]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-06T00:00:00"}