We study the possibility of nullifying time-varying systems with memoryless output feedback. The systems we examine are linear single-input single-output finite-dimensional time-varying systems. For generic completely controllable and completely observable discrete-time systems, we show that any state at any time can be steered to the origin within finite time. An algorithm for nullification an...

Polar codes under successive cancellation decoding proposed by Ar{\i}kan provably achieve the symmetric capacity of any given binary-input discrete memoryless channel. The successive cancellation list decoder for polar codes was described by Tal and Vardy as a generalization of the successive cancellation decoder of Ar{\i}kan. The performance of the successive cancellation list decoder is encou...

We investigate the joint source–channel coding (JSCC) excess distortion exponent (the exponent of the probability of exceeding a prescribed distortion level) for some memoryless communication systems with continuous alphabets. We first establish upper and lower bounds for for systems consisting of a memoryless Gaussian source under the squared-error distortion fidelity criterion and a memoryles...

In this paper, the model of wiretap channel has been reconsidered for the case that the main channel is controlled by channel state information (side information), and it is available at the transmitter in a noncausal manner (termed here noncausal side information) or causal manner (termed here causal side information). Inner and outer bounds are derived on the capacity-equivocation regions for...

Product channel codes are proposed to protect progressively compressed and packetized images for noisy channels. Within packets, the product code uses the concatenation of a rate compatible punctured convolutional code and an error detecting parity check code. Across packets, Reed-Solomon codes are used. Beneets include exible choice of delay, adaptability of error protection level (i.e., unequ...

We show in this paper that arbitrary pole assignment by memoryless feedback is generically possible in the class of generalized first order system of a fixed McMillan degree n as soon as n is strictly less than the input number times the output number. Our result generalizes results by the authors covering the situation when the set of plants consists of strictly proper transfer functions only.