Channel Capacity with Cost Constraint Allowing Cost Overrun

DOI Web Site

抄録

<p>A channel coding problem with cost constraint for general channels is considered. Verdú and Han derived ϵ-capacity for general channels. Following the same lines of its proof, we can also derive ϵ-capacity with cost constraint. In this paper, we derive a formula for ϵ-capacity with cost constraint allowing overrun. In order to prove this theorem, a new variation of Feinstein's lemma is applied to select codewords satisfying cost constraint and codewords not satisfying cost constraint.</p>

収録刊行物

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ