Extremal problems of information combining

Yibo Jiang; Alexei Ashikhmin; Ralf Koetter; Andrew C. Singer

doi:10.1109/ISIT.2005.1523539

Extremal problems of information combining

Yibo Jiang
, Alexei Ashikhmin
, Ralf Koetter
, Andrew C. Singer

Office of the Dean of the College of Engineering and Applied Sciences

University of Illinois at Urbana-Champaign
Nokia

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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.

Original language	English
Title of host publication	Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05
Pages	1236-1240
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2005.1523539
State	Published - 2005
Event	2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: Sep 4 2005 → Sep 9 2005

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2005
ISSN (Print)	2157-8099

Conference

Conference	2005 IEEE International Symposium on Information Theory, ISIT 05
Country/Territory	Australia
City	Adelaide
Period	09/4/05 → 09/9/05

Access to Document

10.1109/ISIT.2005.1523539

Cite this

@inproceedings{118df01c2c274b5f8c62b36edb8577ea,

title = "Extremal problems of information combining",

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.",

author = "Yibo Jiang and Alexei Ashikhmin and Ralf Koetter and Singer, \{Andrew C.\}",

year = "2005",

doi = "10.1109/ISIT.2005.1523539",

language = "English",

isbn = "0780391519",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1236--1240",

booktitle = "Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05",

note = "2005 IEEE International Symposium on Information Theory, ISIT 05 ; Conference date: 04-09-2005 Through 09-09-2005",

}

Jiang, Y, Ashikhmin, A, Koetter, R & Singer, AC 2005, Extremal problems of information combining. in Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05., 1523539, IEEE International Symposium on Information Theory - Proceedings, vol. 2005, pp. 1236-1240, 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, Australia, 09/4/05. https://doi.org/10.1109/ISIT.2005.1523539

Extremal problems of information combining. / Jiang, Yibo; Ashikhmin, Alexei; Koetter, Ralf et al.
Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05. 2005. p. 1236-1240 1523539 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2005).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Extremal problems of information combining

AU - Jiang, Yibo

AU - Ashikhmin, Alexei

AU - Koetter, Ralf

AU - Singer, Andrew C.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/33749426230

U2 - 10.1109/ISIT.2005.1523539

DO - 10.1109/ISIT.2005.1523539

M3 - Conference contribution

AN - SCOPUS:33749426230

SN - 0780391519

SN - 9780780391512

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1236

EP - 1240

BT - Proceedings of the 2005 IEEE International Symposium on Information Theory, ISIT 05

T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05

Y2 - 4 September 2005 through 9 September 2005

ER -

Extremal problems of information combining

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this