{"id":"https://openalex.org/W4415366892","doi":"https://doi.org/10.1109/isit63088.2025.11195255","title":"Partial Orders and Contraction for BISO Channels","display_name":"Partial Orders and Contraction for BISO Channels","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415366892","doi":"https://doi.org/10.1109/isit63088.2025.11195255"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","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/A5051822476","display_name":"Christoph Hirche","orcid":"https://orcid.org/0000-0001-9265-827X"},"institutions":[{"id":"https://openalex.org/I4210136150","display_name":"L3S Research Center","ror":"https://ror.org/039t4wk02","country_code":"DE","type":"facility","lineage":["https://openalex.org/I114112103","https://openalex.org/I4210136150","https://openalex.org/I94509681"]},{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christoph Hirche","raw_affiliation_strings":["Institute for Information Processing (tnt/L3S), Leibniz Universit&#x00E4;t Hannover,Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Information Processing (tnt/L3S), Leibniz Universit&#x00E4;t Hannover,Germany","institution_ids":["https://openalex.org/I4210136150","https://openalex.org/I114112103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5119949814","display_name":"Oxana Shaya","orcid":null},"institutions":[{"id":"https://openalex.org/I4210136150","display_name":"L3S Research Center","ror":"https://ror.org/039t4wk02","country_code":"DE","type":"facility","lineage":["https://openalex.org/I114112103","https://openalex.org/I4210136150","https://openalex.org/I94509681"]},{"id":"https://openalex.org/I114112103","display_name":"Leibniz University Hannover","ror":"https://ror.org/0304hq317","country_code":"DE","type":"education","lineage":["https://openalex.org/I114112103"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Oxana Shaya","raw_affiliation_strings":["Institute for Information Processing (tnt/L3S), Leibniz Universit&#x00E4;t Hannover,Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Information Processing (tnt/L3S), Leibniz Universit&#x00E4;t Hannover,Germany","institution_ids":["https://openalex.org/I4210136150","https://openalex.org/I114112103"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051822476"],"corresponding_institution_ids":["https://openalex.org/I114112103","https://openalex.org/I4210136150"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.39686028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10067","display_name":"Stochastic processes and financial applications","score":0.4609000086784363,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10067","display_name":"Stochastic processes and financial applications","score":0.4609000086784363,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10232","display_name":"Optical Network Technologies","score":0.42739999294281006,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.3937000036239624,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7440999746322632},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.7074000239372253},{"id":"https://openalex.org/keywords/contraction","display_name":"Contraction (grammar)","score":0.6712999939918518},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5483999848365784},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5105999708175659},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.4259999990463257}],"concepts":[{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7440999746322632},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.7074000239372253},{"id":"https://openalex.org/C163415756","wikidata":"https://www.wikidata.org/wiki/Q126473","display_name":"Contraction (grammar)","level":2,"score":0.6712999939918518},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5701000094413757},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5483999848365784},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5105999708175659},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.4259999990463257},{"id":"https://openalex.org/C197947376","wikidata":"https://www.wikidata.org/wiki/Q5155608","display_name":"Comparability","level":2,"score":0.40380001068115234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3824000060558319},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.3393000066280365},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3192000091075897},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.31209999322891235},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.3109000027179718},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.29760000109672546},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.2761000096797943},{"id":"https://openalex.org/C90559484","wikidata":"https://www.wikidata.org/wiki/Q778379","display_name":"Expression (computer science)","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.25870001316070557},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.2581000030040741},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2578999996185303}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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":15,"referenced_works":["https://openalex.org/W2043769961","https://openalex.org/W2080309414","https://openalex.org/W2092515246","https://openalex.org/W2094458162","https://openalex.org/W2129774678","https://openalex.org/W2143062570","https://openalex.org/W2290247654","https://openalex.org/W2524481422","https://openalex.org/W2786354899","https://openalex.org/W2963473808","https://openalex.org/W2963898870","https://openalex.org/W2998261580","https://openalex.org/W4289655109","https://openalex.org/W4292258935","https://openalex.org/W4391952564"],"related_works":[],"abstract_inverted_index":{"A":[0],"fundamental":[1],"question":[2],"in":[3,154],"information":[4,12],"theory":[5],"is":[6],"to":[7,25,34,72,97,122,151],"quantify":[8],"the":[9,37,55,58,73,87,92,98,106,117,123,127,135,144],"loss":[10],"of":[11,40,138,146],"under":[13],"a":[14,131],"noisy":[15,100],"channel.":[16],"Partial":[17],"orders":[18],"and":[19,63,149],"contraction":[20,90,136],"coefficients":[21,137],"are":[22,30,68],"typical":[23],"tools":[24],"that":[26,51],"end,":[27],"however,":[28],"they":[29],"often":[31],"also":[32,142],"challenging":[33],"evaluate.":[35],"For":[36],"special":[38],"class":[39],"binary":[41,59,64,152],"input":[42],"symmetric":[43,60],"output":[44],"(BISO)":[45],"channels,":[46],"Geng":[47],"et":[48],"al.":[49],"showed":[50],"among":[52],"channels":[53,85,104,148,153],"with":[54,70,86,95,105,120],"same":[56,88,93,107,118],"capacity,":[57],"channel":[61,66],"(BSC)":[62],"erasure":[65],"(BEC)":[67],"extremal":[69],"respect":[71,96,121],"more":[74],"capable":[75],"order.":[76,101,125],"Here,":[77],"we":[78,129],"show":[79],"two":[80],"main":[81],"results.":[82],"First,":[83],"for":[84,103,134],"KL":[89],"coefficient,":[91,109,116],"holds":[94,119],"less":[99],"Second,":[102],"Dobrushin":[108],"or":[110,114],"equiv.":[111],"maximum":[112],"leakage":[113],"Doeblin":[115],"degradability":[124],"In":[126],"process,":[128],"provide":[130],"closed-form":[132],"expression":[133],"BISO":[139,147],"channels.":[140],"We":[141],"discuss":[143],"comparability":[145],"extensions":[150],"general.":[155]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}
