{"id":"https://openalex.org/W7160432637","doi":"https://doi.org/10.48550/arxiv.2605.03552","title":"Pareto-type finite-block optimality for source codes: a constrained Markov example","display_name":"Pareto-type finite-block optimality for source codes: a constrained Markov example","publication_year":2026,"publication_date":"2026-05-05","ids":{"openalex":"https://openalex.org/W7160432637","doi":"https://doi.org/10.48550/arxiv.2605.03552"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.03552","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03552","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.2605.03552","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135460024","display_name":"Stefano Della Fiore","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Della Fiore, Stefano","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5135460024"],"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.42289999127388,"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.42289999127388,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.18219999969005585,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.09690000116825104,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/injective-function","display_name":"Injective function","score":0.8330000042915344},{"id":"https://openalex.org/keywords/lexicographical-order","display_name":"Lexicographical order","score":0.7699000239372253},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5253999829292297},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.5238999724388123},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5157999992370605},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5044999718666077},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.49480000138282776},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.37779998779296875}],"concepts":[{"id":"https://openalex.org/C128107574","wikidata":"https://www.wikidata.org/wiki/Q182003","display_name":"Injective function","level":2,"score":0.8330000042915344},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.7699000239372253},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7129999995231628},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5253999829292297},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.5238999724388123},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5157999992370605},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5044999718666077},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.49480000138282776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4934000074863434},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48010000586509705},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.37779998779296875},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3675999939441681},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3483999967575073},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3472000062465668},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.3301999866962433},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.326200008392334},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.3154999911785126},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.3133000135421753},{"id":"https://openalex.org/C2983050975","wikidata":"https://www.wikidata.org/wiki/Q88287214","display_name":"Block structure","level":3,"score":0.3001999855041504},{"id":"https://openalex.org/C128040838","wikidata":"https://www.wikidata.org/wiki/Q1810628","display_name":"Pseudorandom binary sequence","level":3,"score":0.2782999873161316},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.2628999948501587},{"id":"https://openalex.org/C2777021972","wikidata":"https://www.wikidata.org/wiki/Q22976830","display_name":"Uniqueness","level":2,"score":0.2605000138282776},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.2554999887943268}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.03552","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03552","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.2605.03552","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.03552","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":{"We":[0,71],"study":[1],"a":[2,26,73],"Pareto-type":[3],"notion":[4],"of":[5,21],"finite-block":[6],"optimality":[7],"for":[8,116],"injective":[9,75],"source":[10,39],"codes,":[11],"where":[12],"two":[13],"codes":[14],"are":[15],"compared":[16],"through":[17],"the":[18,35,102],"full":[19],"sequence":[20],"expected":[22],"block":[23,104],"lengths.":[24],"As":[25],"concrete":[27],"and":[28,43,91,94],"fully":[29],"analyzable":[30],"test":[31],"case,":[32],"we":[33,106],"revisit":[34],"four-symbol":[36],"constrained":[37],"Markov":[38],"introduced":[40],"by":[41,81,85,89],"Dalai":[42],"Leonardi":[44],"in":[45,98],"their":[46],"\"meaningful":[47],"example''":[48],"on":[49],"constrained-source":[50],"decodability.":[51],"For":[52,101],"each":[53],"admissible":[54,83],"nonempty":[55],"string":[56],"$u=x_1^m":[57],"\\in":[58],"\\mathscr{A}":[59],"\\subset":[60],"\\mathscr{X}^+$,":[61],"let":[62],"$$":[63,66,108,114,119],"K(u):=-\\log_2":[64],"\\mathbb{P}(X_1^m=u)":[65],"denote":[67],"its":[68],"information":[69],"cost.":[70],"construct":[72],"canonical":[74],"binary":[76,96],"mapping":[77],"$C:\\mathscr{A}":[78],"\\to":[79],"\\{0,1\\}^+$":[80],"ordering":[82],"strings":[84,97],"increasing":[86],"$K(u)$,":[87],"then":[88],"length":[90],"lexicographic":[92],"order,":[93],"assigning":[95],"shortlex":[99],"order.":[100],"length-$n$":[103],"$X_1^n$":[105],"prove":[107],"\\mathbb{E}[|C(X_1)|]=\\tfrac32,":[109],"\\qquad":[110],"\\mathbb{E}[|C(X_1^n)|]<\\tfrac32\\,n\\quad":[111],"(n\\ge":[112],"2).":[113],"Moreover,":[115],"every":[117],"fixed":[118],"0":[120]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-05-07T00:00:00"}