Loading…
An information inequality and evaluation of Marton's inner bound for binary input broadcast channels
We establish an information inequality that is intimately connected to the evaluation of the sum rate given by Marton's inner bound for two-receiver broadcast channels with a binary input alphabet. This generalizes a recent result where the inequality was established for a particular channel, t...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 554 |
container_issue | |
container_start_page | 550 |
container_title | |
container_volume | |
creator | Nair, Chandra Wang, Zizhou Vincent Yanlin Geng |
description | We establish an information inequality that is intimately connected to the evaluation of the sum rate given by Marton's inner bound for two-receiver broadcast channels with a binary input alphabet. This generalizes a recent result where the inequality was established for a particular channel, the binary skew-symmetric broadcast channel. The inequality implies that randomized time-division strategy indeed achieves the sum rate of Marton's inner bound for all binary input broadcast channels. |
doi_str_mv | 10.1109/ISIT.2010.5513519 |
format | conference_proceeding |
fullrecord | <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_5513519</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5513519</ieee_id><sourcerecordid>5513519</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-30186a5dde9269ec1a55bcb2942b8bdf7c373d9c195631d906a75ed88d3a23da3</originalsourceid><addsrcrecordid>eNo1kMtOwzAQRc2jEm3pByA23rFK8dhxbC-rqkCkIhYUiV01jh1hlCYlD6T-PUZtV_M4d66uhpA7YHMAZh7z93wz5yyOUoKQYC7IBFKepkob-LwkYw5SJRpAXZGZUfrMmLg-M2bkiIwVT0CZVKgbMum6b8aEEoyPiVvUNNRl0-6wD81_738GrEJ_oFg76n-xGo6kKekrtn1TP3RRVfuW2maIknhLbaixPcT1fuipbRt0BXY9Lb4wCqvuloxKrDo_O9Up-XhabZYvyfrtOV8u1kkAJftEMNAZSue84ZnxBaCUtrDcpNxq60pVxNDOFGBkJsAZlqGS3mntBHLhUEzJ_dE3eO-3-zbsYqrt6XPiDydrXYY</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>An information inequality and evaluation of Marton's inner bound for binary input broadcast channels</title><source>IEEE Xplore All Conference Series</source><creator>Nair, Chandra ; Wang, Zizhou Vincent ; Yanlin Geng</creator><creatorcontrib>Nair, Chandra ; Wang, Zizhou Vincent ; Yanlin Geng</creatorcontrib><description>We establish an information inequality that is intimately connected to the evaluation of the sum rate given by Marton's inner bound for two-receiver broadcast channels with a binary input alphabet. This generalizes a recent result where the inequality was established for a particular channel, the binary skew-symmetric broadcast channel. The inequality implies that randomized time-division strategy indeed achieves the sum rate of Marton's inner bound for all binary input broadcast channels.</description><identifier>ISSN: 2157-8095</identifier><identifier>ISBN: 9781424478903</identifier><identifier>ISBN: 1424478901</identifier><identifier>EISSN: 2157-8117</identifier><identifier>EISBN: 142447891X</identifier><identifier>EISBN: 9781424478910</identifier><identifier>EISBN: 1424478928</identifier><identifier>EISBN: 9781424478927</identifier><identifier>DOI: 10.1109/ISIT.2010.5513519</identifier><identifier>LCCN: 72-179437</identifier><language>eng</language><publisher>IEEE</publisher><subject>Broadcasting ; Channel capacity ; Cramer-Rao bounds ; Decoding ; Random variables ; Stochastic processes ; Tin</subject><ispartof>2010 IEEE International Symposium on Information Theory, 2010, p.550-554</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5513519$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2057,27924,54554,54919,54931</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5513519$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Nair, Chandra</creatorcontrib><creatorcontrib>Wang, Zizhou Vincent</creatorcontrib><creatorcontrib>Yanlin Geng</creatorcontrib><title>An information inequality and evaluation of Marton's inner bound for binary input broadcast channels</title><title>2010 IEEE International Symposium on Information Theory</title><addtitle>ISIT</addtitle><description>We establish an information inequality that is intimately connected to the evaluation of the sum rate given by Marton's inner bound for two-receiver broadcast channels with a binary input alphabet. This generalizes a recent result where the inequality was established for a particular channel, the binary skew-symmetric broadcast channel. The inequality implies that randomized time-division strategy indeed achieves the sum rate of Marton's inner bound for all binary input broadcast channels.</description><subject>Broadcasting</subject><subject>Channel capacity</subject><subject>Cramer-Rao bounds</subject><subject>Decoding</subject><subject>Random variables</subject><subject>Stochastic processes</subject><subject>Tin</subject><issn>2157-8095</issn><issn>2157-8117</issn><isbn>9781424478903</isbn><isbn>1424478901</isbn><isbn>142447891X</isbn><isbn>9781424478910</isbn><isbn>1424478928</isbn><isbn>9781424478927</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2010</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1kMtOwzAQRc2jEm3pByA23rFK8dhxbC-rqkCkIhYUiV01jh1hlCYlD6T-PUZtV_M4d66uhpA7YHMAZh7z93wz5yyOUoKQYC7IBFKepkob-LwkYw5SJRpAXZGZUfrMmLg-M2bkiIwVT0CZVKgbMum6b8aEEoyPiVvUNNRl0-6wD81_738GrEJ_oFg76n-xGo6kKekrtn1TP3RRVfuW2maIknhLbaixPcT1fuipbRt0BXY9Lb4wCqvuloxKrDo_O9Up-XhabZYvyfrtOV8u1kkAJftEMNAZSue84ZnxBaCUtrDcpNxq60pVxNDOFGBkJsAZlqGS3mntBHLhUEzJ_dE3eO-3-zbsYqrt6XPiDydrXYY</recordid><startdate>201006</startdate><enddate>201006</enddate><creator>Nair, Chandra</creator><creator>Wang, Zizhou Vincent</creator><creator>Yanlin Geng</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>201006</creationdate><title>An information inequality and evaluation of Marton's inner bound for binary input broadcast channels</title><author>Nair, Chandra ; Wang, Zizhou Vincent ; Yanlin Geng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-30186a5dde9269ec1a55bcb2942b8bdf7c373d9c195631d906a75ed88d3a23da3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Broadcasting</topic><topic>Channel capacity</topic><topic>Cramer-Rao bounds</topic><topic>Decoding</topic><topic>Random variables</topic><topic>Stochastic processes</topic><topic>Tin</topic><toplevel>online_resources</toplevel><creatorcontrib>Nair, Chandra</creatorcontrib><creatorcontrib>Wang, Zizhou Vincent</creatorcontrib><creatorcontrib>Yanlin Geng</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Nair, Chandra</au><au>Wang, Zizhou Vincent</au><au>Yanlin Geng</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>An information inequality and evaluation of Marton's inner bound for binary input broadcast channels</atitle><btitle>2010 IEEE International Symposium on Information Theory</btitle><stitle>ISIT</stitle><date>2010-06</date><risdate>2010</risdate><spage>550</spage><epage>554</epage><pages>550-554</pages><issn>2157-8095</issn><eissn>2157-8117</eissn><isbn>9781424478903</isbn><isbn>1424478901</isbn><eisbn>142447891X</eisbn><eisbn>9781424478910</eisbn><eisbn>1424478928</eisbn><eisbn>9781424478927</eisbn><abstract>We establish an information inequality that is intimately connected to the evaluation of the sum rate given by Marton's inner bound for two-receiver broadcast channels with a binary input alphabet. This generalizes a recent result where the inequality was established for a particular channel, the binary skew-symmetric broadcast channel. The inequality implies that randomized time-division strategy indeed achieves the sum rate of Marton's inner bound for all binary input broadcast channels.</abstract><pub>IEEE</pub><doi>10.1109/ISIT.2010.5513519</doi><tpages>5</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2157-8095 |
ispartof | 2010 IEEE International Symposium on Information Theory, 2010, p.550-554 |
issn | 2157-8095 2157-8117 |
language | eng |
recordid | cdi_ieee_primary_5513519 |
source | IEEE Xplore All Conference Series |
subjects | Broadcasting Channel capacity Cramer-Rao bounds Decoding Random variables Stochastic processes Tin |
title | An information inequality and evaluation of Marton's inner bound for binary input broadcast channels |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T19%3A04%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=An%20information%20inequality%20and%20evaluation%20of%20Marton's%20inner%20bound%20for%20binary%20input%20broadcast%20channels&rft.btitle=2010%20IEEE%20International%20Symposium%20on%20Information%20Theory&rft.au=Nair,%20Chandra&rft.date=2010-06&rft.spage=550&rft.epage=554&rft.pages=550-554&rft.issn=2157-8095&rft.eissn=2157-8117&rft.isbn=9781424478903&rft.isbn_list=1424478901&rft_id=info:doi/10.1109/ISIT.2010.5513519&rft.eisbn=142447891X&rft.eisbn_list=9781424478910&rft.eisbn_list=1424478928&rft.eisbn_list=9781424478927&rft_dat=%3Cieee_CHZPO%3E5513519%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-30186a5dde9269ec1a55bcb2942b8bdf7c373d9c195631d906a75ed88d3a23da3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5513519&rfr_iscdi=true |