Bounding the minimum distance of affine variety codes using symbolic computations of footprints
From MaRDI portal
Publication:1705516
DOI10.1007/978-3-319-66278-7_12zbMath1429.94104OpenAlexW2747381004MaRDI QIDQ1705516
Publication date: 16 March 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-66278-7_12
Related Items
Minimum-weight codewords of the Hermitian codes are supported on complete intersections ⋮ On affine variety codes from the Klein quartic ⋮ Hermitian codes and complete intersections
This page was built for publication: Bounding the minimum distance of affine variety codes using symbolic computations of footprints
