{"id":"https://openalex.org/W2600757164","doi":"https://doi.org/10.1109/ita.2016.7888174","title":"A coding theorem and converse of Kadota and Wyner revisited","display_name":"A coding theorem and converse of Kadota and Wyner revisited","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2600757164","doi":"https://doi.org/10.1109/ita.2016.7888174","mag":"2600757164"},"language":"en","primary_location":{"id":"doi:10.1109/ita.2016.7888174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2016.7888174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 Information Theory and Applications Workshop (ITA)","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/A5103089220","display_name":"Martin Mittelbach","orcid":"https://orcid.org/0000-0001-6219-6967"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Mittelbach","raw_affiliation_strings":["Chair for Communications Theory, Dresden University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chair for Communications Theory, Dresden University of Technology","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029956964","display_name":"Eduard A. Jorswieck","orcid":"https://orcid.org/0000-0001-7893-8435"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Eduard A. Jorswieck","raw_affiliation_strings":["Chair for Communications Theory, Dresden University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chair for Communications Theory, Dresden University of Technology","institution_ids":["https://openalex.org/I78650965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I78650965"],"apc_list":null,"apc_paid":null,"fwci":0.3101,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.53184295,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.9647786617279053},{"id":"https://openalex.org/keywords/converse-theorem","display_name":"Converse theorem","score":0.776005208492279},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5477527976036072},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5298338532447815},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.524580180644989},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5057775974273682},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45304206013679504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4313575029373169},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.418484091758728},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3483309745788574},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34753626585006714},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3349587917327881},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.3063174784183502},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3004380464553833},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10490700602531433},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08787351846694946},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.0708436369895935}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.9647786617279053},{"id":"https://openalex.org/C204591131","wikidata":"https://www.wikidata.org/wiki/Q5166461","display_name":"Converse theorem","level":3,"score":0.776005208492279},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5477527976036072},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5298338532447815},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.524580180644989},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5057775974273682},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45304206013679504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4313575029373169},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.418484091758728},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3483309745788574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34753626585006714},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3349587917327881},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.3063174784183502},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3004380464553833},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10490700602531433},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08787351846694946},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0708436369895935},{"id":"https://openalex.org/C132817261","wikidata":"https://www.wikidata.org/wiki/Q1134435","display_name":"Automorphic form","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ita.2016.7888174","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2016.7888174","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 Information Theory and Applications Workshop (ITA)","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":16,"referenced_works":["https://openalex.org/W1496462336","https://openalex.org/W1537932563","https://openalex.org/W1974301563","https://openalex.org/W1989008275","https://openalex.org/W2080499779","https://openalex.org/W2105053210","https://openalex.org/W2139657234","https://openalex.org/W2142901448","https://openalex.org/W2212566957","https://openalex.org/W2249670358","https://openalex.org/W2303309297","https://openalex.org/W2498682130","https://openalex.org/W2570322603","https://openalex.org/W2962952842","https://openalex.org/W6688266697","https://openalex.org/W6697713242"],"related_works":["https://openalex.org/W2144181412","https://openalex.org/W4394651134","https://openalex.org/W3033882599","https://openalex.org/W2136333882","https://openalex.org/W2342098551","https://openalex.org/W2990876408","https://openalex.org/W2975771407","https://openalex.org/W1986206926","https://openalex.org/W2910215732","https://openalex.org/W1984199859"],"abstract_inverted_index":{"A":[0],"coding":[1,34],"theorem":[2,35],"and":[3,18,23,48,100,111,118],"converse":[4],"are":[5,59],"proved":[6,37],"for":[7,38,74],"abstract":[8,102],"channels":[9,17,76,113],"with":[10,114],"time":[11],"structure":[12],"that":[13,73,89],"contain":[14],"continuous-time":[15,112],"continuous-valued":[16],"the":[19,33,44,55,77],"result":[20],"by":[21,61],"Kadota":[22],"Wyner":[24],"from":[25],"1972":[26],"as":[27],"special":[28],"cases.":[29],"As":[30],"main":[31],"contribution":[32],"is":[36,71,82,98,104],"a":[39,63,123],"significantly":[40],"weaker":[41],"condition":[42,81],"on":[43],"channel":[45,93],"output":[46,86],"memory":[47,87,117],"without":[49],"imposing":[50],"extra":[51],"measurability":[52],"requirements":[53],"to":[54,84,108],"channel.":[56],"These":[57],"improvements":[58],"achieved":[60],"introducing":[62],"suitable":[64],"characterization":[65],"of":[66],"information":[67],"rate":[68],"capacity.":[69],"It":[70],"shown":[72],"Gaussian":[75],"previously":[78],"used":[79],"\u03c8-mixing":[80],"equivalent":[83],"finite":[85],"demonstrating":[88],"it":[90],"excludes":[91],"important":[92],"models.":[94],"An":[95],"operational":[96],"perspective":[97],"taken":[99],"an":[101],"framework":[103],"established,":[105],"which":[106],"allows":[107],"treat":[109],"discrete-":[110],"(possibly":[115],"infinite)":[116],"arbitrary":[119],"alphabets":[120],"simultaneously":[121],"in":[122],"unified":[124],"way.":[125]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}