On the De Boer-Pellikaan method for computing minimum distance
From MaRDI portal
Publication:992803
DOI10.1016/j.jsc.2010.06.021zbMath1198.94192OpenAlexW2152724910MaRDI QIDQ992803
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
Linear codes (general theory) (94B05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Commutative Artinian rings and modules, finite-dimensional algebras (13E10)
Related Items
On \(a\)-fold products ideals of hyperplane arrangements ⋮ Symbolic powers and free resolutions of generalized star configurations of hypersurfaces ⋮ The minimum distance of sets of points and the minimum socle degree ⋮ A commutative algebraic approach to the fitting problem ⋮ Error-correction of linear codes via colon ideals ⋮ Star configurations are set-theoretic complete intersections ⋮ A blowup algebra for hyperplane arrangements ⋮ Skeleton simplicial evaluation codes ⋮ Generalized star configurations and the Tutte polynomial ⋮ Minimum distance of linear codes and the \(\alpha\)-invariant ⋮ On the Geramita-Harbourne-Migliore conjecture ⋮ On ideals generated by \(a\)-fold products of linear forms ⋮ Plane curves containing a star configuration
Cites Work
- Lower bounds on minimal distance of evaluation codes
- Direct methods for primary decomposition
- Cayley-Bacharach and evaluation codes on complete intersections
- The Horace method for error-correcting codes
- A symbolic test for \((i,j)\)-uniformity in reduced zero-dimensional schemes
- The Geometry of Syzygies
- Hardness of approximating the minimum distance of a linear code
- Minimal vectors in linear codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
