In this paper, we consider the joint decoding of Raptor codes on a binary input additive white Gaussian noise channel. Raptor codes are rateless fountain codes that have the attractive property of being universal on the binary erasure channel: they can approach arbitrarily close the capacity, independently of the channel parameter. It has been recently shown that Raptor codes are not universal ...

The capacity region of m-user non-white Gaussian multiple access channel without feedback was exactly obtained. But it is not yet obtained in the feedback case without the upper bound of total capacity. We give the outer bound of capacity region in muser non-white Gaussian multiple access channel with noiseless and nodelayed feedback in general. Finally we remark that there are three types of o...

The Gaussian arbitrarily varying channel with input constraint r and state constraint 2 admits input sequences x = ( x l , , x , ~ ) of real numbers with Cxf 5 nT and state sequences s = ( 5 ,. , T , ~ ) of real numbers with L Y ~ 5 H A ; the output sequence x + s + V , where V = ( VI, , y , ) is a sequence of independent and identically distributed Gaussian random variables with mean 0 and var...

For the Gaussian channel with intersymbolinterference (ISI), it is known that there is no loss in channel capacity if the receiver is an ideal minimum mean-squared error (MMSE) decision-feedback equalizer (DFE) with error-free feedback. However, combining the DFE with channel coding is problematic. Transmitter precoding and reduced-state sequence estimation are two common approaches (cf. [1] an...

The capacity region of a two-user linear Gaussian compound Multiple Access Channel with common message (CMACC) and intersymbol interference (ISI) under an input power constraint is derived. To obtain the capacity region we first convert the channel to its equivalent memoryless one by defining an n-block memoryless circular Gaussian CMACC model. We then make use of the discrete Fourier transform...