Floor type bound for the minimum distance of generalized algebraic geometric codes (Q886960)

There is a large literature of lower bounds for the minimum distance of algebraic geometry codes. Floor bounds and order bounds give two well-known examples (see the paper of Duursma, Kirov, and Park [\textit{I. Duursma} et al., J. Pure Appl. Algebra 215, No. 8, 1863--1878 (2011; Zbl 1215.14019)], for a discussion of relations between these bounds). Algebraic geometry codes are usually defined in terms of a choice of rational places on an algebraic curve over a finite field. The Generalized Algebraic Geometry codes proposed by Xing, Niederreiter, and Lam in [\textit{C. Xing} et al., IEEE Trans. Inf. Theory 45, No. 7, 2498--2501 (1999; Zbl 0956.94023)] allow for a more general construction using places of higher degree on the curve. Several authors have worked to give lower bounds on these codes, including \textit{A. Picone} [J. Pure Appl. Algebra 217, No. 6, 1164--1172 (2013; Zbl 1271.14031)]. The main result of this paper is to adapt the floor bound given in the above paper of Duursma, Kirov, and Park to generalized algebraic geometry codes and show that it improves Picone's bound.