### Abstract

Building on polar code constructions proposed by the authors for deterministic broadcast channels, two theorems are introduced in the present paper for noisy two-user broadcast channels. The theorems establish polar code constructions for two important information-theoretic broadcast strategies: (1) Cover's superposition strategy; (2) Marton's construction. One aspect of the polar code constructions is the alignment of polarization indices via constraints placed on the auxiliary and channel-input distributions. The codes achieve capacity-optimal rates for several classes of broadcast channels (e.g., binary-input stochastically degraded channels). Applying Arkan's original matrix kernel for polarization, it is shown that the average probability of error in decoding two private messages at the broadcast receivers decays as O(2 ^{-nβ}) where 0 < β < 1/2 and n is the code length. The encoding and decoding complexities remain O(n log n). The error analysis is made possible by defining new polar code ensembles for broadcast channels.

Original language | English (US) |
---|---|

Title of host publication | 2013 IEEE International Symposium on Information Theory, ISIT 2013 |

Pages | 1127-1131 |

Number of pages | 5 |

DOIs | |

State | Published - Dec 19 2013 |

Event | 2013 IEEE International Symposium on Information Theory, ISIT 2013 - Istanbul, Turkey Duration: Jul 7 2013 → Jul 12 2013 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

ISSN (Print) | 2157-8095 |

### Other

Other | 2013 IEEE International Symposium on Information Theory, ISIT 2013 |
---|---|

Country | Turkey |

City | Istanbul |

Period | 7/7/13 → 7/12/13 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Polar codes for broadcast channels'. Together they form a unique fingerprint.

## Cite this

*2013 IEEE International Symposium on Information Theory, ISIT 2013*(pp. 1127-1131). [6620402] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2013.6620402