We examine and compare four different joint-network-channel-codes (JNCC) and three reference systems for the multiple-access relay channel (MARC) with block Rayleigh fading channels for symmetric and asymmetric setups. Two of the JNCC’s were presented previously in the literature and the other two are novel approaches. The JNCC’s outperform the reference systems and achieve a diversity gain for...

Low-density parity-check (LDPC) codes on symmetric memoryless channels have been analyzed using statistical physics by several authors. In this paper, statistical mechanical analysis of LDPC codes is performed for asymmetric memoryless channels and general Markov channels. It is shown that the saddle point equations of the replica symmetric solution for a Markov channel is equivalent to the den...

We consider error-correction over the Non-Binary Symmetric Channel (NBSC) which is a natural probabilistic extension of the Binary Symmetric Channel (BSC). We propose a new decoding algorithm for interleaved Reed-Solomon Codes that attempts to correct all “interleaved” codewords simultaneously. In particular, interleaved encoding gives rise to multi-dimensional curves and more specifically to a...

In this paper, we investigate the binary symmetric wiretap channel. We show that the secrecy capacity can be achieved by using random linear codes. Furthermore, we explore the coset coding scheme constructed by linear codes. As a result, we give an upper bound on the total information loss, which sheds light on the design of the applicable coset codes for the secure transmission with limited in...

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme consists of a combination of interference cancelation, relaying of the other user’s data bits, time sharing, and transmission of random bits, depending on the rate...

We consider a binary symmetric channel where the input, modeled as an innnite sequence of bits, is distorted by a Bernoulli noise. In 8], a consistent estimator of the distortion, i.e., of the probability that a single bit is changed, is described under the basic assumption that the complexity of the input is nite. Here, we deal with two shortcomings: 1. Simons' estimator requires some informat...

1 OFDM Background .....................................................2 2 Baseband Model ..........................................................2 3 Block-Type Pilot Channel Estimation .........................4 4 Comb-Type Pilot Channel Estimation.........................7 5 Other Pilot-Aided Channel Estimations ......................9 6 Performance Evaluation..................................

Advances in communication technology have seen strong interest in digital data transmission. However, illegal data access has become more easy and prevalent in wireless and general communication networks. In order to protect the valuable data from illegal access, different kinds of cryptographic systems have been proposed. In this paper, a new integrating channel coding and cryptography design ...