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 "linear codes over fq which are equivalent to lcd codes"):
  Abstract: Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual are trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks. Non-binary LCD codes in characteristic 2 can be transformed into binary LCD codes by expansion. In this paper, we introduce a general construction of LCD codes from any linear codes. Further, we show that any linear code over $\mathbb F_{q} (q>3)$ is equivalent to an Euclidean LCD code and any linear code over $\mathbb F_{q^2} (q>2)$ is equivalent to a Hermitian LCD code. Consequently an $[n,k,d]$-linear Euclidean LCD code over $\mathbb F_q$ with $q>3$ exists if there is an $[n,k,d]$-linear code over $\mathbb F_q$ and an $[n,k,d]$-linear Hermitian LCD code over $\mathbb F_{q^2}$ with $q>2$ exists if there is an $[n,k,d]$-linear code over $\mathbb F_{q^2}$. Hence, when $q>3$ (resp.$q>2$) $q$-ary Euclidean (resp. $q^2$-ary Hermitian) LCD codes possess the same asymptotical bound as $q$-ary linear codes (resp. $q^2$-ary linear codes). Finally, we present an approach of constructing LCD codes by extending linear codes.

Includes members:
  Member "algebraic geometry codes with complementary duals exceed the asymptotic gilbert varshamov bound":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "some new bounds on lcd codes over finite fields")
  Member "on hermitian lcd codes from cyclic codes and their applications to orthogonal direct sum masking":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "euclidean and hermitian lcd mds codes")
  Member "structure and performance of generalized quasi cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist")
  Member "some bounds on binary lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "binary lcd codes and self orthogonal codes via simplicial complexes")
  Member "euclidean and hermitian lcd mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "galois hulls of mds codes and their quantum error correction")
  Member "complementary dual subfield linear codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "minimal linear codes from characteristic functions")
  Member "parameters of two classes of lcd bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist")

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)