On the De Boer-Pellikaan method for computing minimum distance
DOI10.1016/J.JSC.2010.06.021zbMATH Open1198.94192OpenAlexW2152724910MaRDI QIDQ992803FDOQ992803
Publication date: 10 September 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2010.06.021
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)
Cites Work
- Direct methods for primary decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Geometry of Syzygies
- Title not available (Why is that?)
- Minimal vectors in linear codes
- Cayley-Bacharach and evaluation codes on complete intersections
- Hardness of approximating the minimum distance of a linear code
- Lower bounds on minimal distance of evaluation codes
- The Horace method for error-correcting codes
- Title not available (Why is that?)
- Title not available (Why is that?)
- A symbolic test for \((i,j)\)-uniformity in reduced zero-dimensional schemes
- Title not available (Why is that?)
Cited In (15)
- 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
- Minimum distance of linear codes and the \(\alpha\)-invariant
- The minimum distance of sets of points and the minimum socle degree
- A commutative algebraic approach to the fitting problem
- On ideals generated by \(a\)-fold products of linear forms
- Error-correction of linear codes via colon ideals
- Star configurations are set-theoretic complete intersections
- On the Geramita-Harbourne-Migliore conjecture
Recommendations
- Title not available (Why is that?) ๐ ๐
- 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 ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
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)
