On the De Boer-Pellikaan method for computing minimum distance
Commutative Artinian rings and modules, finite-dimensional algebras (13E10) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
M. De Boer and R. Pellikaan gave a method to compute the minimum distance \(d\) of a linear error correcting code \(\mathcal{C}[n,k,d]\) defined over a (finite) field \(K\), in [\textit{A. M. Cohen, H. Cuypers, H. Sterk}, Some Tapas of Computer Algebra. Algorithms and Computation in Mathematics. 4. Berlin: Springer. (1999; Zbl 0924.13021)]. The present paper discusses some consequences and applications of that method. Section 1 summarizes the De Boer-Pellikaan method, which implies certain ideals \(I_j,\,\, j=1, \dots, n\),\, generated by linear forms in \(K[x_1,\dots, x_k]\), forms determined by the columns of a generating matrix of \(\mathcal{C}\). Section 2 derives some results concerning the (projective) codewords of minimum weight \(d\)\, of \(\mathcal{C}\) and gives a necessary and sufficient condition in terms of \(I_{d+1}\)\, for \(\mathcal{C}\) to be maximum distance separable. Section 3 presents the main result of the paper (Theorem 3.1), which proves that for all \(j=1,\dots , d\),\, \(J_j=m^j\),\, where \(m=(x_1,\dots , x_k)\)\, maximal ideal of \(K[x_1,\dots, x_k]\) and Section 4 derives some consequences for the minimal codewords of \(\mathcal{C}\). Finally Section 5 compares the De Boer-Pellikaan method with the alternative method of \textit{J. Migliore} and \textit{C. Peterson} to find \(d\)\, using Chow forms [J. Symbolic Comput. 37, 403-413 (2004; Zbl 1137.14316)]. The paper gives three reasons that do the De Boer-Pellikaan method \`\` more useful in practice.
- 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
- 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
- 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?)
- Lower bounds on minimal distance of evaluation codes
- Minimal vectors in linear codes
- The Geometry of Syzygies
- The Horace method for error-correcting codes
- A blowup algebra for hyperplane arrangements
- Generalized minimum distance functions
- Generalized star configurations and the Tutte polynomial
- On ideals generated by a-fold products of linear forms
- Skeleton simplicial evaluation codes
- Plane curves containing a star configuration
- On the Geramita-Harbourne-Migliore conjecture
- Error-correction of linear codes via colon ideals
- Star configurations are set-theoretic complete intersections
- A commutative algebraic approach to the fitting problem
- 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
- Homological properties of ideals generated by fold products of linear forms
- Generalized Hamming weights and minimal shifts of Orlik-Terao algebras
- Rose-Terao-Yuzvinsky theorem for reduced forms
- Betti numbers of fold products of linear forms
- Partial fraction decompositions on hyperplane arrangements
- Minimum distance of linear codes and the -invariant
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)
