human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "a parametric approach to list decoding of reed solomon codes using interpolation"
  Abstract: In this paper, we present a minimal list decoding algorithm for Reed-Solomon (RS) codes. Minimal list decoding for a code C refers to list decoding with radius L, where L is the minimum of the distances between the received word r and any codeword in C. We consider the problem of determining the value of L as well as determining all the codewords at distance L. Our approach involves a parametrization of interpolating polynomials of a minimal Grobner basis G . We present two efficient ways to compute G. We also show that so-called re-encoding can be used to further reduce the complexity. We then demonstrate how our parametric approach can be solved by a computationally feasible rational curve fitting solution from a recent paper by Wu. Besides, we present an algorithm to compute the minimum multiplicity as well as the optimal values of the parameters associated with this multiplicity, which results in overall savings in both memory and computation.

Connected through hyperedge HE-1 (induced by source paper "list decoding algorithm based on voting in grobner bases for general one point ag codes"):
  with members:
    - "unique decoding of general ag codes"
    - "feng rao decoding of primary codes"
    - "generalization of the lee o sullivan list decoding for one point ag codes"
    - "list decoding algorithms based on groebner bases for general one point ag codes"
    - "unique decoding of plane ag codes via interpolation"
    - "distance bounds for algebraic geometric codes"
    - "on the order bounds for one point ag codes"
    - "list decoding of hermitian codes using groebner bases"

Connected through hyperedge HE-2 (induced by source paper "an iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings"):
  with members:
    - "minimal polynomial algorithms for finite sequences"
    - "minimal gr obner bases and the predictable leading monomial property"
    - "on minimality of convolutional ring encoders"
    - "new list decoding algorithms for reed solomon and bch codes"

Connected through hyperedge HE-3 (induced by source paper "gabidulin decoding via minimal bases of linearized polynomial modules"):
  with members:
    - "grobner bases for linearized polynomials"
    - "iterative list decoding of gabidulin codes via gr obner based interpolation"
    - "list decoding gabidulin codes via interpolation and the euclidean algorithm"
    - "explicit rank metric codes list decodable with optimal redundancy"
    - "bounds on list decoding of rank metric codes"
    - "error resilience in distributed storage via rank metric codes"
    - "list decoding of subspace codes and rank metric codes up to singleton bound"
    - "general linearized polynomial interpolation and its applications"

Connected through hyperedge HE-4 (induced by source paper "iterative list decoding of gabidulin codes via gr obner based interpolation"):
  with members:
    - "list decoding gabidulin codes via interpolation and the euclidean algorithm"
    - "error resilience in distributed storage via rank metric codes"
    - "general linearized polynomial interpolation and its applications"
    - "fast encoding and decoding of gabidulin codes"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-5 (induced by source paper "list decoding gabidulin codes via interpolation and the euclidean algorithm"):
  with members:
    - "error resilience in distributed storage via rank metric codes"
    - "general linearized polynomial interpolation and its applications"
    - "fast encoding and decoding of gabidulin codes"
    - "on metrics for error correction in network coding"
    - "a rank metric approach to error control in random network coding"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-6 (induced by source paper "on rational interpolation based list decoding and list decoding binary goppa codes"):
  with members:
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"
    - "new list decoding algorithms for reed solomon and bch codes"

Connected through hyperedge HE-7 (induced by source paper "list decoding algorithms based on groebner bases for general one point ag codes"):
  with members:
    - "list decoding algorithm based on voting in grobner bases for general one point ag codes"
    - "generalization of the lee o sullivan list decoding for one point ag codes"
    - "unique decoding of plane ag codes revisited"
    - "unique decoding of plane ag codes via interpolation"
    - "on the order bounds for one point ag codes"
    - "list decoding of hermitian codes using groebner bases"

Question: Please tell me which class the center node 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)