{"id":"https://openalex.org/W7139010223","doi":"https://doi.org/10.1109/globecom59602.2025.11432650","title":"Kelly Bets and Single-Letter Codes: Optimal Information Processing in Natural Systems","display_name":"Kelly Bets and Single-Letter Codes: Optimal Information Processing in Natural Systems","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7139010223","doi":"https://doi.org/10.1109/globecom59602.2025.11432650"},"language":null,"primary_location":{"id":"doi:10.1109/globecom59602.2025.11432650","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5080647939","display_name":"Alexander S. Moffett","orcid":"https://orcid.org/0000-0003-1631-2722"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]},{"id":"https://openalex.org/I4210145836","display_name":"Center for Theoretical Biological Physics","ror":"https://ror.org/04hfg7v94","country_code":"US","type":"facility","lineage":["https://openalex.org/I12912129","https://openalex.org/I181547552","https://openalex.org/I2801539370","https://openalex.org/I4210145836","https://openalex.org/I44461941","https://openalex.org/I74775410"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander S. Moffett","raw_affiliation_strings":["Northeastern University,Center for Theoretical Biological Physics and Department of Physics,Boston,MA,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Northeastern University,Center for Theoretical Biological Physics and Department of Physics,Boston,MA,USA","institution_ids":["https://openalex.org/I12912129","https://openalex.org/I4210145836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5129798141","display_name":"Andrew W. Eckford","orcid":null},"institutions":[{"id":"https://openalex.org/I192455969","display_name":"York University","ror":"https://ror.org/05fq50484","country_code":"CA","type":"education","lineage":["https://openalex.org/I192455969"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Andrew W. Eckford","raw_affiliation_strings":["York University,Dept. of Electrical Engineering and Computer Science,Toronto,Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"York University,Dept. of Electrical Engineering and Computer Science,Toronto,Canada","institution_ids":["https://openalex.org/I192455969"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"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":"1190","last_page":"1195"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.4564000070095062,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.4564000070095062,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.12229999899864197,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.12030000239610672,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5507000088691711},{"id":"https://openalex.org/keywords/information-processing","display_name":"Information processing","score":0.5353000164031982},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5112000107765198},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4964999854564667},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4595000147819519},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4041999876499176},{"id":"https://openalex.org/keywords/investment","display_name":"Investment (military)","score":0.4002000093460083},{"id":"https://openalex.org/keywords/complete-information","display_name":"Complete information","score":0.3686000108718872}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5931000113487244},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5507000088691711},{"id":"https://openalex.org/C87868495","wikidata":"https://www.wikidata.org/wiki/Q750843","display_name":"Information processing","level":2,"score":0.5353000164031982},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5112000107765198},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5076000094413757},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4964999854564667},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4595000147819519},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4041999876499176},{"id":"https://openalex.org/C27548731","wikidata":"https://www.wikidata.org/wiki/Q88272","display_name":"Investment (military)","level":3,"score":0.4002000093460083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39430001378059387},{"id":"https://openalex.org/C113336015","wikidata":"https://www.wikidata.org/wiki/Q574010","display_name":"Complete information","level":2,"score":0.3686000108718872},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.31769999861717224},{"id":"https://openalex.org/C37749351","wikidata":"https://www.wikidata.org/wiki/Q3181395","display_name":"Information processor","level":3,"score":0.30660000443458557},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.3041999936103821},{"id":"https://openalex.org/C180198813","wikidata":"https://www.wikidata.org/wiki/Q121182","display_name":"Information system","level":2,"score":0.29159998893737793},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.2847999930381775},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2728999853134155},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2653999924659729},{"id":"https://openalex.org/C186394612","wikidata":"https://www.wikidata.org/wiki/Q7098942","display_name":"Optimal design","level":2,"score":0.26350000500679016},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.25119999051094055},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom59602.2025.11432650","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","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":23,"referenced_works":["https://openalex.org/W1930819378","https://openalex.org/W1984429906","https://openalex.org/W2002265556","https://openalex.org/W2014116058","https://openalex.org/W2023667568","https://openalex.org/W2034489173","https://openalex.org/W2044692345","https://openalex.org/W2099111195","https://openalex.org/W2101452541","https://openalex.org/W2126922170","https://openalex.org/W2135469284","https://openalex.org/W2148164553","https://openalex.org/W2155528423","https://openalex.org/W2163276114","https://openalex.org/W2241934625","https://openalex.org/W2765277480","https://openalex.org/W2805422391","https://openalex.org/W3202431480","https://openalex.org/W4205346800","https://openalex.org/W4246504144","https://openalex.org/W4320483697","https://openalex.org/W4392343294","https://openalex.org/W4413953410"],"related_works":[],"abstract_inverted_index":{"In":[0,27],"an":[1,72,103],"information-processing":[2],"investment":[3,73],"game,":[4],"such":[5],"as":[6],"the":[7,21,46,68,82,87,90,117],"growth":[8],"of":[9,12,25,112],"a":[10,15,76],"population":[11],"organisms":[13],"in":[14,119],"changing":[16],"environment,":[17],"Kelly":[18,33],"betting":[19],"maximizes":[20],"expected":[22,100],"log":[23],"rate":[24],"growth.":[26],"this":[28,108],"paper,":[29],"we":[30],"show":[31,66],"that":[32,67,81],"bets":[34],"are":[35,123],"closely":[36],"related":[37],"to":[38,101],"optimal":[39,63],"single-letter":[40,92],"codes":[41],"(i.e.,":[42],"they":[43],"can":[44,60],"achieve":[45,61],"rate-distortion":[47,69],"bound":[48,83,109],"with":[49,56],"equality).":[50],"Thus,":[51],"natural":[52],"information":[53,105],"processing":[54,106],"systems":[55],"limited":[57],"computational":[58],"resources":[59],"information-theoretically":[62],"performance.":[64],"We":[65],"tradeoff":[70],"for":[71],"game":[74],"has":[75],"simple":[77],"linear":[78],"bound,":[79],"and":[80],"is":[84,94,99],"achievable":[85],"at":[86],"point":[88],"where":[89],"corresponding":[91],"code":[93],"optimal.":[95],"Moreover,":[96],"since":[97],"evolution":[98],"optimize":[102],"organism\u2019s":[104],"capabilities,":[107],"allows":[110],"prediction":[111],"biological":[113,121],"behaviour.":[114],"Examples":[115],"illustrating":[116],"results":[118],"simplified":[120],"scenarios":[122],"presented.":[124]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-03-20T00:00:00"}