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 "entanglement assisted quantum codes from algebraic geometry codes"):
  Abstract: Quantum error correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error correcting codes to achieve higher rates than the one obtained via traditional stabilizer formalism. Such codes are called entanglement-assisted quantum (QUENTA) codes. In this paper, we use algebraic geometry codes to construct several families of QUENTA codes via Euclidean and Hermitian construction. Two of the families created has maximal entanglement and have quantum Singleton defect equal to zero or one. Comparing the other families with the codes with the respective quantum Gilbert-Varshamov bound, we show that our codes have a rate that surpasses such bound. In the end, asymptotically good tower of linear complementary dual codes is used to obtain an asymptotically good family of maximal entanglement QUENTA codes with nonzero rate, relative minimal distance, and relative entanglement. Furthermore, a simple comparison with the quantum Gilbert-Varshamov bound demonstrates that from our construction it is possible to create an asymptotically family of QUENTA codes that exceed such this bound.

Includes members:
  Member "entanglement assisted quantum error correcting codes over arbitrary finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymmetric entanglement assisted quantum error correcting codes and bch codes")
  Member "entanglement assisted quantum mds codes from constacyclic codes with large minimum distance":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a new method for constructing eaqec mds codes")
  Member "entanglement assisted quantum codes from galois lcd codes":
    also connected through other hyperedges:
      (none)
  Member "constructions of good entanglement assisted quantum error correcting codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on euclidean hulls of mds 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)