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: "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.

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"
    - "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"
    - "a parametric approach to list decoding of reed solomon codes using interpolation"
    - "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 "improved constructions of nested code pairs"):
  with members:
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "xing ling codes duals of their subcodes and good asymmetric quantum codes"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "relative generalized hamming weights of one point algebraic geometric codes"
    - "new quantum codes from evaluation and matrix product codes"
    - "css like constructions of asymmetric quantum codes"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"

Connected through hyperedge HE-3 (induced by source paper "on the distance of stabilizer quantum codes from j affine variety codes"):
  with members:
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "application of constacyclic codes to quantum mds codes"
    - "new quantum codes from evaluation and matrix product codes"
    - "weighted reed muller codes revisited"

Connected through hyperedge HE-4 (induced by source paper "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"):
  with members:
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "new quantum codes from evaluation and matrix product codes"
    - "css like constructions of asymmetric quantum codes"

Connected through hyperedge HE-5 (induced by source paper "an introduction to algebraic geometry codes"):
  with members:
    - "distance bounds for algebraic geometric codes"
    - "on the order bounds for one point ag codes"

Connected through hyperedge HE-6 (induced by source paper "cryptanalysis of mceliece cryptosystem based on algebraic geometry codes and their subcodes"):
  with members:
    - "squares of random linear codes"
    - "a polynomial time attack on the bbcrs scheme"
    - "cryptanalysis of public key cryptosystems that use subcodes of algebraic geometry codes"
    - "polynomial time attack on wild mceliece over quadratic extensions"
    - "a polynomial time attack against algebraic geometry code based public key cryptosystems"
    - "distinguisher based attacks on public key cryptosystems using reed solomon codes"
    - "on products and powers of linear codes under componentwise multiplication"

Connected through hyperedge HE-7 (induced by source paper "relative generalized hamming weights of one point algebraic geometric codes"):
  with members:
    - "relative generalized rank weight of linear codes and its applications to network coding"
    - "an improvement of the feng rao bound for primary codes"
    - "further improvements on the feng rao bound for dual codes"
    - "on the order bounds for one point ag codes"
    - "mds codes on the erasure erasure wiretap channel"
    - "strongly secure ramp secret sharing schemes for general access structures"

Connected through hyperedge HE-8 (induced by source paper "relative generalized hamming weights of q ary reed muller codes"):
  with members:
    - "on asymptotically good ramp secret sharing schemes"
    - "relative generalized hamming weights of cyclic codes"
    - "refined analysis of rghws of code pairs coming from garcia stichtenoth s second tower"
    - "relative generalized hamming weights of one point algebraic geometric codes"

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)