Bounds on the achievable rates of block coding for a memoryless multiple-access channel
Bounds on the achievable rates of block coding for a memoryless multiple-access channel
复制标题
DOI：
10.1109/tit.1978.1055860
复制
发表时间：
1978-03
期刊：
影响因子：
--
通讯作者：
T. Kasami;Shu Lin
中科院分区：
文献类型：
--
作者：
T. Kasami;Shu Lin
研究了无记忆二输入单输出多址信道（称为二用户加法器信道）的分组编码。提出了用于构造用于该特定信道的码的技术。这些代码的可实现的速率的上限和下限推导。这些界限定义了双用户加法器通道可实现的编码速率的各种二维区域。
Block coding for a memoryless two-input single-output multiple-access channel, called a two-user adder channel, is studied. Techniques for constructing codes for this particular channel are presented. Upper and lower bounds on the achievable rates of these codes are derived. These bounds define various two-dimensional regions for the achievable rates of codes for the two-user adder channel.