scientific article
From MaRDI portal
Publication:2921702
zbMath1297.94128MaRDI QIDQ2921702
Alexander Vardy, Venkatesan Guruswami
Publication date: 13 October 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Decoding (94B35)
Related Items (3)
Deep holes in Reed-Solomon codes based on Dickson polynomials ⋮ Algorithms for modular counting of roots of multivariate polynomials ⋮ On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
This page was built for publication:
