human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "feng rao decoding of primary codes"):
  Abstract: Abstract   We show that the Feng–Rao bound for dual codes and a similar bound by Andersen and Geil (2008)  [1]  for primary codes are consequences of each other. This implies that the Feng–Rao decoding algorithm can be applied to decode primary codes up to half their designed minimum distance. The technique applies to any linear code for which information on well-behaving pairs is available. Consequently we are able to decode efficiently a large class of codes for which no non-trivial decoding algorithm was previously known. Among those are important families of multivariate polynomial codes. Matsumoto and Miura (2000)  [30]  (see also Beelen and Hoholdt, 2008  [3] ) derived from the Feng–Rao bound a bound for primary one-point algebraic geometric codes and showed how to decode up to what is guaranteed by their bound. The exposition in Matsumoto and Miura (2000)  [30]  requires the use of differentials which was not needed in Andersen and Geil (2008)  [1] . Nevertheless we demonstrate a very strong connection between Matsumoto and Miuraʼs bound and Andersen and Geilʼs bound when applied to primary one-point algebraic geometric codes.

Includes members:
  Member "list decoding algorithm based on voting in grobner bases for general one point ag codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "unique decoding of general ag codes")
  Member "unique decoding of plane ag codes revisited":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "list decoding algorithms based on groebner bases for general one point ag codes")
  Member "list decoding algorithms based on groebner bases for general one point ag codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "list decoding algorithm based on voting in grobner bases for general one point ag codes")
  Member "unique decoding of plane ag codes via interpolation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "list decoding algorithm based on voting in grobner bases for general one point ag codes")
  Member "weighted reed muller codes revisited":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar decreasing monomial cartesian codes")
  Member "distance bounds for algebraic geometric codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "list decoding algorithm based on voting in grobner bases for general one point ag codes")
  Member "on the order bounds for one point ag codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "vard o hus codes polar codes based on castle curves kernels")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)