Evaluation codes defined by finite families of plane valuations at infinity (Q2436567)

This paper proposes a method to construct algebraic-geometric error-correcting codes using plane valuations at infinity. \textit{T. Høholdt}, \textit{J. H. van Lint} and \textit{R. Pellikaan} [\textit{T. Høholdt} et al., in: V. S. Pless (ed.) et al., Handbook of coding theory. Vol. 1, 871--961 (1998; Zbl 0922.94015)] gave an interpretation of the one-point algebraic-geometric codes in terms of order and weight functions defined over order domains \(R\)\, and with values in the non-negative integers (or, more generally, in a well-ordered semigroup). A weight function defines a valuation of the function field of \(R\). In a previous paper [Proc. Lond. Math. Soc. (3) 98, No. 3, 714--740 (2009; Zbl 1163.94007)], the authors studied the construction of evaluation codes defined by weight functions associated with plane valuations at infinity and they introduced the concept of \(\delta\)-sequences (generating sets of the value semigroup). The present paper improves these results. Section 2 defines the concept of well-suited families of elements in an ordered commutative group and studies an associated weight function \(w\)\, and the evaluation codes associated with \(w\). Section 3 introduces the concept of sum of \(\delta\)-sequences and proves (Theorem 3.4) that such a sum is a well-suited family, allowing to construct evaluation codes of arbitrary length. Finally Section 4 shows examples of codes (defined over \(\mathbb{F}_2, \mathbb{F}_3, \mathbb{F}_5\))\, obtained with the proposed method.