scientific article; zbMATH DE number 671739
From MaRDI portal
Publication:4310100
zbMath0810.94032MaRDI QIDQ4310100
Publication date: 18 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Goppa codesmaximum distance separable codeslinear error-correcting codespoints in uniform positionCayley- Bacharach scheme
Linear codes (general theory) (94B05) Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Complete intersections (14M10)
Related Items (12)
Lower bounds on minimal distance of evaluation codes ⋮ A symbolic test for \((i,j)\)-uniformity in reduced zero-dimensional schemes ⋮ Minimum distance of some evaluation codes ⋮ Vanishing ideals over complete multipartite graphs ⋮ Fat points, partial intersections and Hamming distance ⋮ The Horace method for error-correcting codes ⋮ The minimum distance of sets of points and the minimum socle degree ⋮ On the uniformity of zero-dimensional complete intersections ⋮ On the castelnuovo-mumford regularity of a projective system ⋮ Cayley-Bacharach and evaluation codes on complete intersections ⋮ On the De Boer-Pellikaan method for computing minimum distance ⋮ Minimum distance of linear codes and the \(\alpha\)-invariant
This page was built for publication:
