Exponents of polar codes using algebraic geometric code kernels

DOI10.1007/s10623-014-9987-8zbMath1300.14030OpenAlexW2069064669MaRDI QIDQ398987

Gretchen L. Matthews, Sarah E. Anderson

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

zbMATH Keywords

exponentpolar codesalgebraic geometric codes

Mathematics Subject Classification ID

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

Cites Work

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

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