2017/07/13 by Maria Bras-Amorós, Bras-Amorós, Maria
Computer Science · Engineering · Mathematics · Medicine · #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Peptidase Inhibition and Analysis #cs.DM #graph theory and CDMA systems #math.CO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1707.04062
arxiv created 2017/07/13 · openalex publication_date 2017/07/13 · arxiv updated 2019/06/26 · openalex created_date 2022/09/05 · openalex updated_date 2026/07/28
Consider a sequence of AG codes evaluating at a set of evaluation points P1,…,Pn the functions having only poles at a defining point Q, with the sequence of codes satisfying the isometry-dual condition (i.e. containing at the same time primal and their dual codes). We prove a necessary condition under which, after taking out a number of evaluation points (i.e. puncturing), the resulting AG codes can still satisfy the isometry-dual property. The condition has to do with the so-called maximum sparse ideals of the Weierstrass semigroup of Q.