We consider channel coding for discrete memoryless channels (DMCs) with a novel cost constraint that constrains both the mean and the variance of the cost of the codewords. We show that the maximum (asymptotically) achievable rate under the new cost formulation is equal to the capacity-cost function; in particular, the strong converse holds. We further characterize the optimal second-order coding rate of these cost-constrained codes; in particular, the optimal second-order coding rate is finite. We then show that the second-order coding performance is strictly improved with feedback using a new variation of timid/bold coding, significantly broadening the applicability of timid/bold coding schemes from unconstrained compound-dispersion channels to all cost-constrained channels. Equivalent results on the minimum average probability of error are also given.

翻译：我们研究离散无记忆信道（DMC）在一种新型代价约束下的信道编码问题，该约束同时对码字的代价均值和方差施加限制。我们证明，在新代价公式下最大（渐近）可达速率等于容量-代价函数；特别地，强逆定理成立。我们进一步刻画了这些受代价约束的码的最优二阶编码率；具体而言，最优二阶编码率是有限的。接着，我们利用胆怯/大胆编码的一种新变体证明反馈能够严格提升二阶编码性能，从而将胆怯/大胆编码方案的适用范围从无约束复合色散信道显著扩展至所有受代价约束的信道。此外，还给出了关于最小平均错误概率的等价结果。