We propose a novel cooperative protocol with the joint channel and network code for the multiple-access relay channel with two sources, one relay, and one destination. In the proposed cooperation, by using a superposi...
详细信息
ISBN:
(纸本)9781424476855
We propose a novel cooperative protocol with the joint channel and network code for the multiple-access relay channel with two sources, one relay, and one destination. In the proposed cooperation, by using a superposition technique, the relay node combines the information from both sources and forwards it to the destination, simultaneously. Although several superposition techniques have been proposed (e.g., superposition modulation, network coding), we will utilize a modified nested coding scheme which can be applied to iterative decoding. In the proposed relay system, the decoding operation at the destination node is adaptively changed according to the decoding results of each direct link (from source to destination channel), but the structures of sources and relay are not changed. If the one of the direct links is in failure, the system can be operated as just the distributed turbo coding proposed for the simplest relay channel with one source, one relay and one destination. Even if both direct links are in failure, the destination can still iteratively decode both sources' data with three received signals from individual sources and relay. Simulation results reveal that the proposed system can significantly improve the performance.
A new class of nested linear block code is introduced. The codes of this class, referred to as nested codes. cover a wide range of code length and rates. The parity check matrix of a nested code is constructed from tw...
详细信息
A new class of nested linear block code is introduced. The codes of this class, referred to as nested codes. cover a wide range of code length and rates. The parity check matrix of a nested code is constructed from two other linear block codes. Although the rates of the resulting codes are not optimal. the codes nevertheless exhibit some useful properties: in particular. they have a well-defined mathematical structure. which leads to a fast and simple decoding algorithm.
In this paper we consider a wiretap channel II with an active eavesdropper. Aggarwal et al ( 2009) were the first who studied the Ozarow-Wyner's binary wiretap channel II in the presence of an active eavesdropper....
详细信息
ISBN:
(纸本)9781467398145
In this paper we consider a wiretap channel II with an active eavesdropper. Aggarwal et al ( 2009) were the first who studied the Ozarow-Wyner's binary wiretap channel II in the presence of an active eavesdropper. They derived achievable secrecy rates for two modification models where the eavesdropper can erase/replace the bits he observes. The existence of better achievable rates remains an open problem. Here we study a model with a less powerful eavesdropper. The eavesdropper is able now to observe any interval of mu symbol positions and erase the symbols in any interval of l positions of a transmitted codeword. We present an explicit construction of nested linear codes that achieve maximum secrecy rate for the finite length coding regime, with perfect secrecy and zero-error decoding, for any admissible code parameters.
In this paper we consider a wiretap channel II with an active eavesdropper. Aggarwal et al (2009) were the first who studied the Ozarow-Wyner's binary wiretap channel II in the presence of an active eavesdropper. ...
详细信息
ISBN:
(纸本)9781467398152
In this paper we consider a wiretap channel II with an active eavesdropper. Aggarwal et al (2009) were the first who studied the Ozarow-Wyner's binary wiretap channel II in the presence of an active eavesdropper. They derived achievable secrecy rates for two modification models where the eavesdropper can erase/replace the bits he observes. The existence of better achievable rates remains an open problem. Here we study a model with a less powerful eavesdropper. The eavesdropper is able now to observe any interval of μ symbol positions and erase the symbols in any interval of l positions of a transmitted codeword. We present an explicit construction of nested linear codes that achieve maximum secrecy rate for the finite length coding regime, with perfect secrecy and zero-error decoding, for any admissible code parameters.
暂无评论