Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
复制标题
DOI：
10.1109/tit.1983.1056614
复制
发表时间：
1983
期刊：
影响因子：
--
通讯作者：
T. Kasami;Shu Lin;V. Wei;Saburo Yamamura
中科院分区：
文献类型：
--
作者：
T. Kasami;Shu Lin;V. Wei;Saburo Yamamura
我们将双用户多址二进制加法器通道的编码与图论中的一个问题（称为独立集问题）联系起来。提出了同步和非同步双用户加法器通道编码的图论方法。利用简单图独立数上的 Tuŕan 定理，我们能够提高 Kasami 和 Lin 导出的同步加法器通道的唯一和 δ 可解码码的可实现速率的下界。我们还能够得出非同步加法器通道的唯一可解码代码的可实现速率的下限。我们表明非同步加法器通道的 Deaett-Wolf 码速率低于界限。构造非同步加法器通道的同步序列。
We relate coding for the two-user multiple-access binary adder channel to a problem in graph theory, known as the independent set problem. Graph-theoretic approaches to coding for both synchronized and nonsynchronized two-user adder channels are presented. Using the Tuŕan theorem on the independence number of a simple graph, we are able to improve the lower bounds on the achievable rates of uniquely and \delta -decodable codes for the synchronized adder channel derived by Kasami and Lin. We are also able to derive lower bounds on the achievable rates of uniquely decodable codes for the nonsynchronized adder channel. We show that the rates of Deaett-Wolf codes for the nonsynchronized adder channel fall below the bounds. Synchronizing sequences for the nonsynchronized adder channel are constructed.