We give an upper bound to the finite block length capacity of discrete time nonstationary Gaussian channel with feedback. With the aid of minimization of a quadratic form, it is proved that the feedback capacity Cn,FB(P ) and the nonfeedback capacity Cn(P ) satisfies Cn(P ) ≤ Cn,FB(P ) ≤ Cn(P∗), where P∗ is concretely given.

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical information theory. We determine the quantum capacity of finite compound channels and arbitrary compound channels with informed decoder. Our approach in the finite c...

In this talk I will present various criteria of difference in the context of strings, i.e. sequences of symbols taken from a finite or countable set, usually referred to as an alphabet. These problems are motivated by the concept of graph capacity, introduced by Shannon in the context of error-free communication over a noisy channel, where we require the strings to differ in special pairs of sy...

The cable tower of Liede Bridge is a double-column curved-lever arched-beam portal framed structure. Being novel and unique in structure, its cable tower differs in complexity from traditional ones. This paper analyzes the ultimate load capacity of cable tower by adopting the finite element calculations and model tests which indicate that constitutive relations applied here give a better simula...

Sparse superposition codes, or sparse regression codes (SPARCs), are a recent class of codes for reliable communication over the AWGN channel at rates approaching the channel capacity. Approximate message passing (AMP) decoding, a computationally efficient technique for decoding SPARCs, has been proven to be asymptotically capacity-achieving for the AWGN channel. In this paper, we refine the as...