Exponents of polar codes using algebraic geometric code kernels

DOI10.1007/S10623-014-9987-8zbMATH Open1300.14030OpenAlexW2069064669MaRDI QIDQ398987FDOQ398987

Authors: Sarah E. Anderson, Gretchen L. Matthews 

Publication date: 18 August 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-014-9987-8

Recommendations

• Vardøhus codes: polar codes based on castle curves kernels
• The exponent of a polarizing matrix constructed from the Kronecker product
• Recursive descriptions of polar codes
• On Reed-Muller codes over \(\mathbb F_2+u\mathbb F_2\) and some applications
• Polar codes

zbMATH Keywords

polar codesexponentalgebraic geometric codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Algebraic function fields and codes
• Geometric reed-solomon codes of length 64 and over 65 over F/sub 8/
• Title not available (Why is that?)
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Polarization and polar codes
• Source and Channel Polarization Over Finite Fields and Reed–Solomon Matrices
• Polar Codes for $q$-Ary Channels, $q=2^{r}$
• On the small-weight codewords of some Hermitian codes
• Polar Codes: Characterization of Exponent, Bounds, and Constructions

Cited In (2)

• The exponent of a polarizing matrix constructed from the Kronecker product
• Vardøhus codes: polar codes based on castle curves kernels

This page was built for publication: Exponents of polar codes using algebraic geometric code kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398987)