FR1.R3.1

Generalized concatenated polarization kernels

Petr Trifonov, ITMO University, Russia
Session:
Polar codes 3
Track:
2: Modern Coding Theory
Location:
Ypsilon IV-V-VI
Presentation Time:
Fri, 12 Jul, 09:45 - 10:05
Session Chair:
Hsin-Po Wang,
Abstract
A novel class of polarization kernels is proposed, which is based on the construction of generalized concatenated codes. The complexity of the kernel processing operation, which is the computational core of the (list) successive cancellation decoder, for the obtained kernels of size 64 is several orders of magnitude less compared to BCH and Yao-Fazeli-Vardy kernels. Polar subcodes based on the obtained kernels under list successive cancellation decoder provide both performance and complexity improvement with respect to those based on the Arikan kernel.
Session FR1.R3
FR1.R3.1: Generalized concatenated polarization kernels
Petr Trifonov, ITMO University, Russia
FR1.R3.2: Near-Optimal Generalized Decoding of Polar-like Codes
Peihong Yuan, MIT, United States; Ken Duffy, Northeastern University, United States; Muriel Médard, MIT, United States
FR1.R3.3: Weight Structure of Low/High-Rate Polar Codes and Its Applications
Mohammad Rowshan, University of New South Wales (UNSW), Australia; Vlad-Florin Dragoi, Aurel Vlaicu University, Romania; Jinhong Yuan, University of New South Wales (UNSW), Australia
FR1.R3.4: Finite-Length Analysis of Polar Secrecy Codes for Wiretap Channels
Hessam Mahdavifar, Northeastern University, United States; Fariba Abbasi, University of Michigan, United States
Resources
View Manuscript