{"paper":{"title":"Information Structures of Maximizing Distributions of Feedback Capacity for General Channels with Memory & Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Charalambos D. Charalambous, Christos K. Kourtellaris","submitted_at":"2016-04-04T21:05:02Z","abstract_excerpt":"For any class of channel conditional distributions, with finite memory dependence on channel input RVs $A^n {\\stackrel{\\triangle}{=}} \\{A_i: i=0, \\ldots, n\\}$ or channel output RVs $B^n {\\stackrel{\\triangle}{=}} \\{B_i: i=0, \\ldots, n\\}$ or both, we characterize the sets of channel input distributions, which maximize directed information defined by $ I(A^n \\rightarrow B^n) {\\stackrel{\\triangle}{=}} \\sum_{i=0}^n I(A^i;B_i|B^{i-1}) $ and we derive the corresponding expressions, called \"characterizations of Finite Transmission Feedback Information (FTFI) capacity\". The main theorems state that opt"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01063","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}