The compound capacity of polar codes

We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-input memoryless output-symmetric channels. By deriving a sequence of upper and lower bounds, we show that in general the compound capacity under successive decoding is strictly smaller...

Full description

Saved in:
Bibliographic Details
Main Authors: Hassani, S.H., Korada, S.B., Urbanke, R.
Format: Conference Proceeding
Language:English
Subjects:
Channel capacity
Channel coding
Code standards
Decoding
Distributed computing
Error probability
History
Mutual information
Source coding
Transmitters
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 21
container_issue
container_start_page 16
container_title
container_volume
creator Hassani, S.H.
Korada, S.B.
Urbanke, R.
description We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-input memoryless output-symmetric channels. By deriving a sequence of upper and lower bounds, we show that in general the compound capacity under successive decoding is strictly smaller than the unrestricted compound capacity.
doi_str_mv 10.1109/ALLERTON.2009.5394827
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5394827</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5394827</ieee_id><sourcerecordid>5394827</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-98d35c2b3351e3dee7e9d55d78ef3afa8a36f21527ae54fbfc07fa093277c4423</originalsourceid><addsrcrecordid>eNpVj0FLw0AQhVdEUGp-gQg5eE3c3dlxdo-lVCsECxLPZbo7i5HWhKQe-u8t2Ivv8vh48MFT6t7o2hgdHudNs3xv12-11TrUCMF5SxeqCOSNs86hJ-Mu_7Gma1VM05c-xaENYG7UQ_spZez3Q__zncrIA8fucCz7XA79jsfTlGS6VVeZd5MU556pj-dlu1hVzfrldTFvqs4QHqrgE2C0WwA0AkmEJCTERF4ycGbP8JStQUss6PI2R02ZdQBLFJ2zMFN3f95ORDbD2O15PG7O3-AXg-tCCA</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>The compound capacity of polar codes</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hassani, S.H. ; Korada, S.B. ; Urbanke, R.</creator><creatorcontrib>Hassani, S.H. ; Korada, S.B. ; Urbanke, R.</creatorcontrib><description>We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-input memoryless output-symmetric channels. By deriving a sequence of upper and lower bounds, we show that in general the compound capacity under successive decoding is strictly smaller than the unrestricted compound capacity.</description><identifier>ISBN: 9781424458707</identifier><identifier>ISBN: 1424458706</identifier><identifier>EISBN: 9781424458714</identifier><identifier>EISBN: 1424458714</identifier><identifier>DOI: 10.1109/ALLERTON.2009.5394827</identifier><language>eng</language><publisher>IEEE</publisher><subject>Channel capacity ; Channel coding ; Code standards ; Decoding ; Distributed computing ; Error probability ; History ; Mutual information ; Source coding ; Transmitters</subject><ispartof>2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2009, p.16-21</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/5394827$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54899</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5394827$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hassani, S.H.</creatorcontrib><creatorcontrib>Korada, S.B.</creatorcontrib><creatorcontrib>Urbanke, R.</creatorcontrib><title>The compound capacity of polar codes</title><title>2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)</title><addtitle>ALLERTON</addtitle><description>We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-input memoryless output-symmetric channels. By deriving a sequence of upper and lower bounds, we show that in general the compound capacity under successive decoding is strictly smaller than the unrestricted compound capacity.</description><subject>Channel capacity</subject><subject>Channel coding</subject><subject>Code standards</subject><subject>Decoding</subject><subject>Distributed computing</subject><subject>Error probability</subject><subject>History</subject><subject>Mutual information</subject><subject>Source coding</subject><subject>Transmitters</subject><isbn>9781424458707</isbn><isbn>1424458706</isbn><isbn>9781424458714</isbn><isbn>1424458714</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpVj0FLw0AQhVdEUGp-gQg5eE3c3dlxdo-lVCsECxLPZbo7i5HWhKQe-u8t2Ivv8vh48MFT6t7o2hgdHudNs3xv12-11TrUCMF5SxeqCOSNs86hJ-Mu_7Gma1VM05c-xaENYG7UQ_spZez3Q__zncrIA8fucCz7XA79jsfTlGS6VVeZd5MU556pj-dlu1hVzfrldTFvqs4QHqrgE2C0WwA0AkmEJCTERF4ycGbP8JStQUss6PI2R02ZdQBLFJ2zMFN3f95ORDbD2O15PG7O3-AXg-tCCA</recordid><startdate>200909</startdate><enddate>200909</enddate><creator>Hassani, S.H.</creator><creator>Korada, S.B.</creator><creator>Urbanke, R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200909</creationdate><title>The compound capacity of polar codes</title><author>Hassani, S.H. ; Korada, S.B. ; Urbanke, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-98d35c2b3351e3dee7e9d55d78ef3afa8a36f21527ae54fbfc07fa093277c4423</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Channel capacity</topic><topic>Channel coding</topic><topic>Code standards</topic><topic>Decoding</topic><topic>Distributed computing</topic><topic>Error probability</topic><topic>History</topic><topic>Mutual information</topic><topic>Source coding</topic><topic>Transmitters</topic><toplevel>online_resources</toplevel><creatorcontrib>Hassani, S.H.</creatorcontrib><creatorcontrib>Korada, S.B.</creatorcontrib><creatorcontrib>Urbanke, R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hassani, S.H.</au><au>Korada, S.B.</au><au>Urbanke, R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>The compound capacity of polar codes</atitle><btitle>2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton)</btitle><stitle>ALLERTON</stitle><date>2009-09</date><risdate>2009</risdate><spage>16</spage><epage>21</epage><pages>16-21</pages><isbn>9781424458707</isbn><isbn>1424458706</isbn><eisbn>9781424458714</eisbn><eisbn>1424458714</eisbn><abstract>We consider the compound capacity of polar codes under successive cancellation decoding for a collection of binary-input memoryless output-symmetric channels. By deriving a sequence of upper and lower bounds, we show that in general the compound capacity under successive decoding is strictly smaller than the unrestricted compound capacity.</abstract><pub>IEEE</pub><doi>10.1109/ALLERTON.2009.5394827</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781424458707
ispartof 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2009, p.16-21
issn
language eng
recordid cdi_ieee_primary_5394827
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Channel capacity
Channel coding
Code standards
Decoding
Distributed computing
Error probability
History
Mutual information
Source coding
Transmitters
title The compound capacity of polar codes
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T19%3A41%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=The%20compound%20capacity%20of%20polar%20codes&rft.btitle=2009%2047th%20Annual%20Allerton%20Conference%20on%20Communication,%20Control,%20and%20Computing%20(Allerton)&rft.au=Hassani,%20S.H.&rft.date=2009-09&rft.spage=16&rft.epage=21&rft.pages=16-21&rft.isbn=9781424458707&rft.isbn_list=1424458706&rft_id=info:doi/10.1109/ALLERTON.2009.5394827&rft.eisbn=9781424458714&rft.eisbn_list=1424458714&rft_dat=%3Cieee_6IE%3E5394827%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-98d35c2b3351e3dee7e9d55d78ef3afa8a36f21527ae54fbfc07fa093277c4423%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=5394827&rfr_iscdi=true