scientific article; zbMATH DE number 671739

MaRDI QIDQ4310100zbMATH OpenFDO

Authors Johan P. Hansen

Publication date 18 April 1995

zbMATH Keywords

Goppa codesmaximum distance separable codeslinear error-correcting codespoints in uniform positionCayley- Bacharach scheme

Mathematics Subject Classification ID

Complete intersections (14M10) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05)

Recommendations

• Linear codes from ruled sets in finite projective spaces
• Maximum distance separable codes and arcs in projective spaces
• Error-correcting codes from higher-dimensional varieties
• On linear codes from maximal curves
• Construction of Linear Codes With Large Minimum Distance

Cited in

(13)

• Vanishing ideals over complete multipartite graphs
• The Horace method for error-correcting codes
• On the De Boer-Pellikaan method for computing minimum distance
• Lower bounds on minimal distance of evaluation codes
• The minimum distance of sets of points and the minimum socle degree
• On the castelnuovo-mumford regularity of a projective system
• Minimum distance of some evaluation codes
• On the \(P\)-construction of algebraic-geometry codes
• Minimum distance of linear codes and the \(\alpha\)-invariant
• A symbolic test for \((i,j)\)-uniformity in reduced zero-dimensional schemes
• On the uniformity of zero-dimensional complete intersections
• Cayley-Bacharach and evaluation codes on complete intersections
• Fat points, partial intersections and Hamming distance

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4310100)