RANDOM CODING THEOREM FOR BROADCAST CHANNELS WITH DEGRADED COMPONENTS
RANDOM CODING THEOREM FOR BROADCAST CHANNELS WITH DEGRADED COMPONENTS
复制标题
DOI：
10.1109/tit.1973.1054980
复制
发表时间：
1973-01-01
影响因子：
2.5
通讯作者：
BERGMANS, PP
中科院分区：
文献类型：
--
作者：
BERGMANS, PP
本文将Cover关于双二进制对称广播信道（BSC）的结果推广到含有分量的退化信道。一个随机码，及其相关的解码方案，示出具有预期的概率错误同时为零的码字长度趋于无穷大的所有组件，如果点代表的各种接收机的速率福尔斯落在本文所描述的可实现的速率集。给出了一个删除好的随机广播码的过程，从而得到了最大错误概率的界。二进制对称广播信道总是属于降级广播信道的类别。本文的结果被应用到这类潜在的实际重要性的渠道。
This paper generalizes Cover's results on broadcast channels with two binary symmetric channels (BSC) to the class of degraded channels withcomponents. A random code, and its associated decoding scheme, is shown to have expected probability of error going to zero for all components simultaneously as the codeword length goes to infinity, if the point representing the rates to the various receivers falls in the set of achievable rates described by this paper. A procedure to expurgate a good random broadcast code is given, leading to a bound on the maximum probability of error. Binary symmetric broadcast channels always fall in the class of degraded broadcast channels. The results of the paper are applied to this class of channels of potential practical importance.