On the De Boer-Pellikaan method for computing minimum distance
From MaRDI portal
Publication:992803
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear codes (general theory) (94B05) Commutative Artinian rings and modules, finite-dimensional algebras (13E10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Recommendations
- scientific article; zbMATH DE number 4010390
- Minimum distance functions of graded ideals and Reed-Muller-type codes
- Error-correction of linear codes via colon ideals
- On minimum distance bounds for abelian codes
- Code distances of some classes of (p,p)-codes
- Minimum distances of error-correcting codes in incidence rings
- Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
- Linkage and codes on complete intersections
- scientific article; zbMATH DE number 4055529
- scientific article; zbMATH DE number 691462
Cites work
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1243360 (Why is no real title available?)
- scientific article; zbMATH DE number 1276821 (Why is no real title available?)
- scientific article; zbMATH DE number 671739 (Why is no real title available?)
- A computational criterion for the supersolvability of line arrangements.
- A symbolic test for \((i,j)\)-uniformity in reduced zero-dimensional schemes
- Algebraic geometric codes. Basic notions
- Cayley-Bacharach and evaluation codes on complete intersections
- Direct methods for primary decomposition
- Hardness of approximating the minimum distance of a linear code
- Lower bounds on minimal distance of evaluation codes
- Minimal vectors in linear codes
- The Geometry of Syzygies
- The Horace method for error-correcting codes
Cited in
(17)- Generalized star configurations and the Tutte polynomial
- On \(a\)-fold products ideals of hyperplane arrangements
- Generalized minimum distance functions
- Skeleton simplicial evaluation codes
- Plane curves containing a star configuration
- Symbolic powers and free resolutions of generalized star configurations of hypersurfaces
- Homological properties of ideals generated by fold products of linear forms
- A blowup algebra for hyperplane arrangements
- Generalized Hamming weights and minimal shifts of Orlik-Terao algebras
- Minimum distance of linear codes and the -invariant
- The minimum distance of sets of points and the minimum socle degree
- Error-correction of linear codes via colon ideals
- Star configurations are set-theoretic complete intersections
- On ideals generated by a-fold products of linear forms
- A commutative algebraic approach to the fitting problem
- On the Geramita-Harbourne-Migliore conjecture
- Rose-Terao-Yuzvinsky theorem for reduced forms
This page was built for publication: On the De Boer-Pellikaan method for computing minimum distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992803)
