{"id":"https://openalex.org/W7154599604","doi":"https://doi.org/10.48550/arxiv.2604.13588","title":"On the Information Velocity over a Tandem of Erasure Channels","display_name":"On the Information Velocity over a Tandem of Erasure Channels","publication_year":2026,"publication_date":"2026-04-15","ids":{"openalex":"https://openalex.org/W7154599604","doi":"https://doi.org/10.48550/arxiv.2604.13588"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.13588","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13588","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.13588","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133821727","display_name":"Kai-Chun Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Kai-Chun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5080524212","display_name":"I-Hsiang Wang","orcid":"https://orcid.org/0000-0003-0695-5724"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, I-Hsiang","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/T13553","display_name":"Age of Information Optimization","score":0.48579999804496765,"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"}},"topics":[{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.48579999804496765,"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"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.22509999573230743,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.09430000185966492,"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/erasure","display_name":"Erasure","score":0.6887999773025513},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4372999966144562},{"id":"https://openalex.org/keywords/dissemination","display_name":"Dissemination","score":0.41519999504089355},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4041000008583069},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4000000059604645},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.39730000495910645},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.39469999074935913},{"id":"https://openalex.org/keywords/information-theoretic-security","display_name":"Information-theoretic security","score":0.3862000107765198},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.37229999899864197},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.3720000088214874}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6887999773025513},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5618000030517578},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4372999966144562},{"id":"https://openalex.org/C101780184","wikidata":"https://www.wikidata.org/wiki/Q840576","display_name":"Dissemination","level":2,"score":0.41519999504089355},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4041000008583069},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.39730000495910645},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.39469999074935913},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3935000002384186},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.3862000107765198},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38179999589920044},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.37229999899864197},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.3720000088214874},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3709000051021576},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.36329999566078186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35019999742507935},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.34929999709129333},{"id":"https://openalex.org/C2777814067","wikidata":"https://www.wikidata.org/wiki/Q1752317","display_name":"Tandem","level":2,"score":0.34549999237060547},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.33649998903274536},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.32269999384880066},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.32190001010894775},{"id":"https://openalex.org/C2983568541","wikidata":"https://www.wikidata.org/wiki/Q389772","display_name":"Information transmission","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.30079999566078186},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.29899999499320984},{"id":"https://openalex.org/C2985963534","wikidata":"https://www.wikidata.org/wiki/Q7603704","display_name":"State information","level":3,"score":0.29420000314712524},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.28209999203681946},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2815000116825104},{"id":"https://openalex.org/C87868495","wikidata":"https://www.wikidata.org/wiki/Q750843","display_name":"Information processing","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.27630001306533813},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.25519999861717224}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.13588","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13588","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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.13588","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13588","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":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Information":[0],"velocity":[1],"(IV)":[2],"is":[3,21,40,146],"a":[4,17,62,112,202],"recently":[5],"proposed":[6],"notion":[7],"to":[8,51,54,150,188],"capture":[9],"the":[10,22,44,70,90,94,97,131,154,168,176,182,189,193,197,216,220,223,231,240],"speed":[11,23],"of":[12,64,133,192],"reliable":[13,26],"information":[14,191,207,241],"dissemination":[15],"over":[16,29,160],"large-scale":[18],"network.":[19,199],"It":[20],"at":[24],"which":[25],"end-to-end":[27],"communication":[28],"$k$":[30,49],"hops":[31],"can":[32],"be":[33],"achieved":[34],"within":[35],"$t$":[36],"time":[37,161],"instances,":[38],"and":[39,162,214],"defined":[41],"formally":[42],"as":[43,48],"asymptotic":[45],"ratio":[46],"$k/t$":[47],"tends":[50],"infinity":[52],"subject":[53],"vanishing":[55],"error":[56],"probability.":[57,144],"To":[58,165],"date,":[59],"even":[60],"for":[61,73,93,219,230],"tandem":[63],"binary":[65],"erasure":[66],"channels":[67],"without":[68],"feedback,":[69],"optimal":[71,91,217],"IV":[72,92,218],"disseminating":[74],"multiple":[75],"(say":[76],"$m$)":[77],"bits":[78,119,135],"remains":[79],"unknown.":[80],"We":[81],"make":[82],"progress":[83],"on":[84],"this":[85],"open":[86],"problem":[87],"by":[88],"characterizing":[89],"regime":[95,169,221,232],"where":[96,109,156,178,222],"message":[98,118,224],"size":[99,225],"$m":[100,170,226,233],"=":[101,171,227,234],"o(k^{1/2})$.":[102],"The":[103],"main":[104],"contribution":[105],"lies":[106],"in":[107,120,147,153,181,196],"achievability,":[108],"we":[110,173,209],"propose":[111],"simple":[113],"bit-separation":[114],"scheme":[115,213],"that":[116,130],"pipelines":[117],"an":[121,211],"orderly":[122],"fashion":[123],"with":[124,139,142,204],"carefully":[125],"designed":[126],"temporal":[127],"spacing":[128],"so":[129],"flows":[132],"different":[134],"do":[136],"not":[137,238],"collide":[138],"one":[140],"another":[141],"high":[143],"This":[145],"sharp":[148],"contrast":[149],"previous":[151],"attempts":[152],"literature":[155],"schemes":[157],"involve":[158],"coding":[159],"across":[163],"nodes.":[164],"go":[166],"beyond":[167],"o(k^{1/2})$,":[172,235],"further":[174],"investigate":[175],"setting":[177,203],"every":[179],"node":[180],"network":[183],"has":[184],"strictly":[185],"causal":[186],"access":[187],"state":[190,206],"BEC":[194],"links":[195],"entire":[198],"For":[200],"such":[201],"global":[205],"(GSI),":[208],"develop":[210],"enhanced":[212],"characterize":[215],"o(k)$.":[228],"Interestingly,":[229],"GSI":[236],"does":[237],"improve":[239],"velocity.":[242]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-17T00:00:00"}