Polar Codes: Characterization of Exponent, Bounds, and Constructions
From MaRDI portal
Publication:5281177
DOI10.1109/TIT.2010.2080990zbMath1366.94746MaRDI QIDQ5281177
Eren Şaşoğlu, Satish Babu Korada, Ruediger Urbanke
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (9)
General Strong Polarization ⋮ On Reed-Muller codes over \(\mathbb F_2+u\mathbb F_2\) and some applications ⋮ Exponents of polar codes using algebraic geometric code kernels ⋮ Design and decoding of polar codes with large kernels: a survey ⋮ The exponent of a polarizing matrix constructed from the Kronecker product ⋮ Recursive descriptions of polar codes ⋮ On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length ⋮ Unnamed Item ⋮ Polar codes with higher-order memory
This page was built for publication: Polar Codes: Characterization of Exponent, Bounds, and Constructions