In this paper we propose a novel covert channel for exchanging secret information, based on the IP header record route options. Instead of encrypting a secret message or embedding it into a multimedia object, as in traditional steganography, we process the entire message and generate several IP packets with different types to carry the secret information. Thereby we foil an eavesdropper who is ...

In this paper, we study, information theoretically, the impact of transmitter and or receiver cognition on the channel capacity. The cognition can be described by state information, dependent on the channel noise and or input. Specifically, as a new idea, we consider the receiver cognition as a state information dependent on the noise and we derive a capacity theorem based on the Gaussian versi...

Abstract— In this paper, a channel that is contaminated by two independent Gaussian noises S ∼ N (0, Q) and Z0 ∼ N (0, N0) is considered. The capacity of this channel is computed when independent noisy versions of S are known to the transmitter and/or receiver. It is shown that the channel capacity is greater then the capacity when S is completely unknown, but is less then the capacity when S i...

We define a class of symmetric discrete memoryless multiple-access channels. This definition incorporates previous definitions of symmetry for single user channels and is characterized by the optimality of the uniform distribution with respect to total channel capacity. We further identify a sub-class of channels in which channel symmetry is a direct result of a transposition symmetry in the tr...

This article deals with the derivation and analysis of the statistical properties of the instantaneous channel capacity of N*Nakagami-m channels, which has been recently introduced as a suitable stochastic model for multihop fading channels. We have derived exact analytical expressions for the probability density function (PDF), cumulative distribution function (CDF), level-crossing rate (LCR),...

The capacity of a narrow-band subliminal channel can be proportional to log 2 n, and then its upper bound is log 2 n where n is the number of input values a subliminal transmitter tried. These results are obtained, provided that only the single carrier is transmitted. In this paper, we consider a practical model, a successive carrier-transmission model, where carriers are transmitted one after ...

We consider flat-fading multiple antenna channels with t transmit and r receive antennas, which is modeled by an r × t complex matrix H . The first n eigenvectors of H†H , where 0 ≤ n ≤ min(t, r), are assumed to be available at the transmitter as partial spatial information of channel. A transmission method was proposed which enables better use of the multiple-input multiple-output (MIMO) chann...

This paper presents measured data from a narrowband multiple-input multiple-output (MIMO) channel probe in an indoor office/laboratory environment. The system employs ten transmit and ten receive antennas and computes the 10 10 narrowband channel matrix at 2.45 GHz every 80 milliseconds. We use the data to study the statistical behavior of the channel coefficients and the resulting channel capa...

Multiple Antennas in Wireless Communications: Array Signal Processing and Channel Capacity