Extremal Problems of Information Combining (original) (raw)

IEEE Transactions on Information Theory

Abstract

In this paper we study moments of soft-bits of binary-input symmetric-output channels and solve some extremal problems of the moments. We use these results to solve the extremal information combining problem. Further, we extend the information combining problem by adding a constraint on the second moment of soft-bits, and find the extreme distributions for this new problem.

Alexei Ashikhmin hasn't uploaded this paper.

Let Alexei know you want this paper to be uploaded.

Ask for this paper to be uploaded.