Block successive cancellation decoding of polarization-based codes

Dina Goldin, David Burshtein

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

Abstract

Linear codes constructed using a polarization transformation followed by short blocklength sub-codes are proposed. Decoding is realized by the successive cancellation algorithm combined with standard optimal or non-optimal decoding of the sub-codes. List successive cancellation decoding can also be used. We demonstrate gains compared to standard successive cancellation of polar codes for short blocklength codes.

Original languageEnglish
Title of host publication2016 9th International Symposium on Turbo Codes and Iterative Information Processing
Subtitle of host publicationPaths to 5G and Beyond, ISTC 2016
PublisherIEEE Computer Society
Pages256-260
Number of pages5
ISBN (Electronic)9781509034017
DOIs
StatePublished - 17 Oct 2016
Event9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016 - Brest, France
Duration: 5 Sep 20169 Sep 2016

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
Volume2016-October
ISSN (Print)2165-4700
ISSN (Electronic)2165-4719

Conference

Conference9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016
Country/TerritoryFrance
CityBrest
Period5/09/169/09/16

Fingerprint

Dive into the research topics of 'Block successive cancellation decoding of polarization-based codes'. Together they form a unique fingerprint.

Cite this