| Abstract: |
| In this talk we combine the theory of iterated monodromy groups with Chebotarev density theorem for global function fields to construct locally recoverable codes. In general, the approach we propose allows to extend Tamo-Barg method essentially to any base field, without requiring arithmetic restrictions on the pair (size of the base field, locality), but still obtaining optimal codes. |
|