Hard Problems of Algebraic Geometry Codes
From MaRDI portal
Publication:3604740
DOI10.1109/TIT.2007.911213zbMath1308.94113arXivcs/0507026OpenAlexW2019009209MaRDI QIDQ3604740
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0507026
Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Decoding (94B35)
Related Items (9)
ECC\(^2\): error correcting code and elliptic curve based cryptosystem ⋮ On Random Number Generation for Kernel Applications ⋮ NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem ⋮ Subset sums over Galois rings. II ⋮ On the equivalence of two post-quantum cryptographic families ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Counting subset sums of finite Abelian groups ⋮ New constructions of MDS symbol-pair codes ⋮ Subset sums over Galois rings
This page was built for publication: Hard Problems of Algebraic Geometry Codes
