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 "some bounds on binary lcd codes"):
  Abstract: A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\perp}$ satisfies $C \cap C^{\perp}$= $\left\{ \mathbf{0}\right\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of $d$ among $[n,k,d]$ binary LCD codes. We give exact values of $LCD{[}n,k{]}$ for $1 \le k \le n \le 12$. #R##N#We also show that $LCD[n,n-i]=2$ for any $i\geq2$ and $n\geq2^{i}$. Furthermore, we show that $LCD[n,k]\leq LCD[n,k-1]$ for $k$ odd and $LCD[n,k]\leq LCD[n,k-2]$ for $k$ even.

Includes members:
  Member "on mds negacyclic lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "some new bounds on lcd codes over finite fields")
  Member "complementary dual subfield linear codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist")
  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 "matrix product complementary dual codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lcd matrix product codes over commutative rings")
  Member "the reversible negacyclic codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "some binary bch codes with length n 2 m 1")
  Member "a family of reversible bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "euclidean and hermitian lcd mds codes")
  Member "lcd cyclic codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (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)