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 "algebraic geometry codes with complementary duals exceed the asymptotic gilbert varshamov bound"):
  Abstract: It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound still remains to be the best asymptotical lower bound for LCD codes. In this paper, we show that an algebraic geometry code over a finite field of even characteristic is equivalent to an LCD code and consequently there exists a family of LCD codes that are equivalent to algebraic geometry codes and exceed the asymptotical GV bound.

Includes members:
  Member "some bounds on binary lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "binary lcd codes and self orthogonal codes via simplicial complexes")
  Member "linear codes over fq which are equivalent to lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "binary lcd codes from mathbb z _2 mathbb z _2 u")
  Member "complementary dual algebraic geometry codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimal linear codes from characteristic functions")
  Member "lcd cyclic codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "self reciprocal and self conjugate reciprocal irreducible factors of x n lambda and their applications")
  Member "the combinatorics of lcd codes linear programming bound and orthogonal matrices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "binary lcd codes from mathbb z _2 mathbb z _2 u")

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)