Polar codes with mixed kernels

Noam Presman, Ofer Shapira, Simon Litsyn

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

Abstract

A generalization of the polar coding scheme is proposed. It exploits several homogeneous kernels over alphabets of different sizes. An analysis of the introduced scheme is undertaken. Specifically, asymptotic properties of the polarization are shown to be strongly related to the ones of the constituent kernels.

Original languageEnglish
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages6-10
Number of pages5
DOIs
StatePublished - 2011
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: 31 Jul 20115 Aug 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Conference

Conference2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/TerritoryRussian Federation
CitySt. Petersburg
Period31/07/115/08/11

Fingerprint

Dive into the research topics of 'Polar codes with mixed kernels'. Together they form a unique fingerprint.

Cite this