The collision channel without feedback
The collision channel without feedback
复制标题
DOI：
10.1109/tit.1985.1057010
复制
发表时间：
1985-03
期刊：
影响因子：
--
通讯作者：
J. Massey;P. Mathys
中科院分区：
文献类型：
--
作者：
J. Massey;P. Mathys
提出了一个模型的情况下，M个用户共享一个共同的通信资源，但由于未知的时间偏移之间的时钟，不能发送他们的数据包在分时模式，由于缺乏反馈链路，永远不能确定这些时间偏移，也永远不能肯定的结果，他们的个人数据包传输。每个用户都需要在由协议信号确定的时间进行数据包传输，该协议信号与要发送的数据无关。该信道的容量和零误差容量区域被确定为非同步和时隙同步的情况下，这四个区域被示出为一致。它进一步表明，该区域的外边界上的一组密集的速率点可以实现在时隙同步的情况下。给出了实现这些点的协议序列的具体构造，并引入了“抽取解码”技术来识别每个成功传输的数据包的发送方。在任意大小的字母表的最大擦除突发校正码的构造和示出足以重建的数据包丢失的“冲突”时，这些协议序列被使用。
A model is proposed for the situation where M users share a common communication resource but, because of unknown time offsets among their clocks, cannot transmit their data packets in a time-sharing mode and, because of the lack of a feedback link, can never determine these time offsets and also can never be sure of the outcomes of their individual packet transmissions. Each user is required to make his packet transmissions at times determined by a protocol signal that is independent of the data to be sent. The capacity and zero-error capacity regions of this channel are determined for both the unsynchronized and slot-synchronized cases; these four regions are shown to coincide. It is further shown that a dense set of rate points on the outer boundary of this region can be achieved in the slot-synchronized case. Specific constructions of protocol sequences for achieving these points are given, and the technique of "decimation decoding" is introduced for identifying the sender of each successfully transmitted packet. Maximum-erasure burst-correcting codes over an alphabet of arbitrary size are constructed and shown to suffice for reconstructing the packets lost in "collisions" when these protocol sequences are used.