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 "improved constructions of nested code pairs"):
  Abstract: Two new constructions of linear code pairs $C_2 \subset C_1$ are given for which the codimension and the relative minimum distances $M_1(C_1,C_2)$, $M_1(C_2^\perp,C_1^\perp)$ are good. By this we mean that for any two out of the three parameters the third parameter of the constructed code pair is large. Such pairs of nested codes are indispensable for the determination of good linear ramp secret sharing schemes [35]. They can also be used to ensure reliable communication over asymmetric quantum channels [47]. The new constructions result from carefully applying the Feng-Rao bounds [18,27] to a family of codes defined from multivariate polynomials and Cartesian product point sets.

Includes members:
  Member "on the distance of stabilizer quantum codes from j affine variety codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymmetric entanglement assisted quantum error correcting codes and bch codes")
  Member "stabilizer quantum codes from j affine variety codes and a new steane like enlargement":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "locally recoverable j affine variety codes")
  Member "xing ling codes duals of their subcodes and good asymmetric quantum codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "constructions of pure asymmetric quantum alternant codes based on subclasses of alternant codes")
  Member "quantum codes from affine variety codes and their subfield subcodes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "asymmetric entanglement assisted quantum error correcting codes and bch codes")
  Member "relative generalized hamming weights of one point algebraic geometric codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on asymptotically good ramp secret sharing schemes")
  Member "new quantum codes from evaluation and matrix product codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "lcd matrix product codes over commutative rings")
  Member "feng rao decoding of primary codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "list decoding algorithm based on voting in grobner bases for general one point ag codes")
  Member "css like constructions of asymmetric quantum codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "asymmetric entanglement assisted quantum error correcting codes and bch codes")

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)