The dual minimum distance of arbitrary dimensional algebraic--geometric codes
The dual minimum distance of arbitrary dimensional algebraic--geometric codes
复制标题
DOI：
10.1016/j.jalgebra.2011.09.030
复制
发表时间：
2009-05
期刊：
影响因子：
--
通讯作者：
Alain Couvreur
中科院分区：
文献类型：
--
作者：
Alain Couvreur
In this article, the minimum distance of the dual C⊥of a functional code C on an arbitrary-dimensional variety X over a finite field Fqis studied. The approach is based on problems à la Cayley–Bacharach and consists in describing the minimal configurations of points on X which fail to impose independent conditions on forms of some degree m. If X is a curve, the result improves in some situations the well-known Goppa designed distance.
