In this work we construct sequences of locally recoverable AG codes arising from a tower of function fields and give bound for the parameters of the obtained codes. In a particular case of a tower over $\mathbb{F}_{q^2}$ for any odd $q$, defined by Garcia and Stichtenoth in [GS2007], we show that the bound is sharp for the first code in the sequence, and we include a detailed analysis for the following codes in the sequence based on the distribution of rational places that split completely in the considered function field extension.

翻译：在这项工作中,我们根据功能字段塔生成的可在当地回收的AG代码序列,并按获得的代码参数设定。在加西亚和施蒂特诺斯在[GS2007] 中界定的任何奇数美元超过$mathbb{F ⁇ q ⁇ 2}的塔,我们显示该序列中第一个代码的界限是尖锐的,我们包含对以下代码的详细分析,其序列基于合理地点的分配,这些合理地点在考虑的功能字段扩展中完全分割。