This paper presents analytical techniques for trellis codes on AWGN channels with periodic fading. The paper begins with an asymptotically tight union bound on the bit error rate of a trellis code on such a channel and a procedure for eeciently computing the required transfer function for any trellis code, including those that do not satisfy regularity properties that simplify the task. Periodi...

This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...

AhtracrThis paper investigates encoders optimization for Hamming weight after periodic puncturing, rind discusses minimality issues that may affect the performanoe of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal. If it is not minimal, it may have a zero-output loop and it may be Catastrophic. A code search can us...

We consider the interference channel in which messages sent at one encoder are known to the other encoder, but not vice versa. Such channel model allows for unidirectional node cooperation: the encoder that knows both messages can exploit that information to improve the achievable rates. We derive conditions under which the capacity region of this channel coincides with the capacity region of t...

In this paper we evaluate the performance of several Space-Time Coded GSM radio interfaces with channels measured in a tunnel of the Metro of Paris using a radiating system comprising of four transmitting and four receiving antennas. We first consider space-time equalization techniques that only account for the noise and the Intersymbol Interference (ISI) induced by the modulation and then anal...

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...

In 1988 the Dutch government launched a proposal for a national health insurance based on regulated competition. The mandatory benefits package should be offered by competing insurers and should cover both non-catastrophic risks (like hospital care, physician services and drugs) and catastrophic risks (like several forms of expensive long-term care). However, there are two arguments to exclude ...

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a “pearl...