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

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

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 (US)
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

Other

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

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Online availability

10.1109/ISIT.2005.1523539

Library availability

Discover UIUC Full Text

Cite this

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

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, 9/4/05. https://doi.org/10.1109/ISIT.2005.1523539

@inproceedings{5d49a18b9770421ab300fa2c182256ea,

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 (US)",

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

}

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 - http://www.scopus.com/inward/record.url?scp=33749426230&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749426230&partnerID=8YFLogxK

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

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this