scientific article; zbMATH DE number 671739

zbMATH Open0810.94032MaRDI QIDQ4310100FDOQ4310100

Authors: Johan P. Hansen 

Publication date: 18 April 1995

Title of this publication is not available (Why is that?)

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

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)

Cited In (13)

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