This paper introduces a quantitative generalization of the ``more capable'' comparison of broadcast channels, which is termed ``more capable with advantage''. Some basic properties are demonstrated (including tensorization on product channels), and a characterisation is given for the cases of Binary Symmetric Channel (BSC) and Binary Erasure Channel (BEC). It is then applied to two problems. First, a list decoding bound on the BSC is given that applies to transitive codes that achieve capacity on the BEC. Second, new lower bounds on entropy rates of binary hidden Markov processes are derived.

翻译：本文引入了广播信道“更为能”比较的量化推广，将其称为“具有优势的更为能”。展示了若干基本性质（包括乘积信道上的张量化），并给出了二进制对称信道（BSC）和二进制擦除信道（BEC）情形的刻画。随后将其应用于两个问题：首先，针对在BEC上达到容量的传递码，给出了BSC上的列表译码界；其次，推导了二进制隐马尔可夫过程熵率的新下界。