A lower bound on the probability of error of polar codes over BMS channels

Boaz Shuval, Ido Tal

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Consider a polar code designed for some binary memoryless symmetric channel. We develop a lower bound on the probability of error of this polar code under successive-cancellation decoding. The bound exploits the correlation between the various codeword bits and improves upon existing lower bounds.

Original languageEnglish
Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
Pages854-858
Number of pages5
ISBN (Electronic)9781509040964
DOIs
StatePublished - 9 Aug 2017
Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
Duration: 25 Jun 201730 Jun 2017

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2017 IEEE International Symposium on Information Theory, ISIT 2017
Country/TerritoryGermany
CityAachen
Period25/06/1730/06/17

Keywords

  • Channel polarization
  • Channel upgrading
  • Lower bounds
  • Polar codes
  • Probability of error

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A lower bound on the probability of error of polar codes over BMS channels'. Together they form a unique fingerprint.

Cite this