Name
Abstract | ||
|---|---|---|
If C is an [n,k,d]-linear code, computing its minimum distance, d, leads to deciding if certain ideals I generated by products of linear forms are Artinian or not (De Boer and Pellikaan, 1999). In this note we show that when these ideals are Artinian, then they must be powers of the maximal (irrelevant) ideal. We discuss some theoretical consequences of this result in connection to projective minimal codewords. In the end we compare the De Boer-Pellikaan method with the Migliore-Peterson method (Migliore and Peterson, 2004). |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.jsc.2010.06.021 | J. Symb. Comput. |
Keywords | DocType | Volume |
Linear codes,Minimum distance,Hilbert polynomial,Regularity | Journal | 45 |
Issue | ISSN | Citations |
10 | 0747-7171 | 3 |
PageRank | References | Authors |
0.65 | 4 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stefan O. Tohaneanu | 1 | 15 | 5.03 |