This paper generalizes parallel error correcting codes proposed by Ahlswede et al. over a new type of multiple access channel called parallel error channel. The generalized parallel error correcting codes can handle with more errors compared with the original ones. We show construction methods of independent and non-independent parallel error correcting codes and decoding methods. We derive som...

Abstract— A linear space-time block code (STBC) is a vector space spanned by its defining weight matrices over the real number field. We define a Quadratic Form (QF), called the Hurwitz-Radon QF (HRQF), on this vector space and give a QF interpretation of the ML decoding complexity of a STBC. It is shown that the ML decoding complexity is only a function of the weight matrices defining the code...

We introduce space–time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space–time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbe...

Abstract. Relativistic heavy ion collisions produce thousands of particles, and it is sometimes difficult to believe that these processes allow for a theoretical description directly in terms of the underlying theory – QCD. However once the parton densities are sufficiently large, an essential simplification occurs – the dynamics becomes semi– classical. As a result, a simple ab initio approach...

In the present paper, the modified Runge-Kutta method is constructed, and it is proved that the modified Runge-Kutta method preserves the order of accuracy of the original one. The necessary and sufficient conditions under which the modified Runge-Kutta methods with the variable mesh are asymptotically stable are given. As a result, the θ-methods with 1 2 ≤ θ ≤ 1, the odd stage Gauss-Legendre m...

This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New upper bounds on the maximum-likelihood (ML) decoding error probability are derived. These bounds are applied to various ensembles of turbo-like codes, focusing especially on repeat-accumulate codes and their recent va...

sig Node { } // addr nodes and host nodes // addr hode is a non-leaf, host node is a leaf sig AddrNode extends Node { masklen: Int, hostlen: Int,

C = 1 2 log2 (1 + SNR) where SNR = PX σ N . Shannon showed that in the limit of using long block length n, generating 2 i.i.d. N (0, PX) codewords and averaging across all codebooks is a capacity-achieving strategy: with high likelihood the power constraint will be satisfied and the average probability of error under ML decoding tends to 0 as n → ∞. This result can be derived geometrically as w...