human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "binary lcd codes from mathbb z _2 mathbb z _2 u"):
  with members:
    - "some new bounds on lcd codes over finite fields"
    - "self dual cyclic and quantum codes over z2 alpha x z2 uz2 beta"
    - "constructions of optimal lcd codes over large finite fields"
    - "euclidean and hermitian lcd mds codes"
    - "new binary and ternary lcd codes"
    - "galois lcd codes over finite fields"
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

Connected through hyperedge HE-2 (induced by source paper "linear complementary dual maximum distance separable codes"):
  with members:
    - "coding theory the unit derived methodology"
    - "new characterization and parametrization of lcd codes"
    - "complementary dual algebraic geometry codes"
    - "systems of mds codes from units and idempotents"
    - "codes from zero divisors and units in group rings"

Connected through hyperedge HE-3 (induced by source paper "some new bounds on lcd codes over finite fields"):
  with members:
    - "on mds negacyclic lcd codes"
    - "algebraic geometry codes with complementary duals exceed the asymptotic gilbert varshamov bound"
    - "on sigma lcd codes"
    - "some bounds on binary lcd codes"
    - "constructions of optimal lcd codes over large finite fields"
    - "euclidean and hermitian lcd mds codes"
    - "new characterization and parametrization of lcd codes"
    - "galois lcd codes over finite fields"

Connected through hyperedge HE-4 (induced by source paper "on sigma lcd codes"):
  with members:
    - "on hermitian lcd codes from cyclic codes and their applications to orthogonal direct sum masking"
    - "structure and performance of generalized quasi cyclic codes"
    - "euclidean and hermitian lcd mds codes"
    - "new characterization and parametrization of lcd codes"
    - "galois lcd codes over finite fields"
    - "complementary dual subfield linear codes over finite fields"
    - "complementary dual algebraic geometry codes"
    - "parameters of two classes of lcd bch codes"

Connected through hyperedge HE-5 (induced by source paper "new binary and ternary lcd codes"):
  with members:
    - "euclidean and hermitian lcd mds codes"
    - "improved constructions of nested code pairs"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "lcd cyclic codes over finite fields"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "quantum codes from affine variety codes and their subfield subcodes"
    - "new quantum codes from evaluation and matrix product codes"
    - "linearity and complements in projective space"

Connected through hyperedge HE-6 (induced by source paper "explicit mds codes with complementary duals"):
  with members:
    - "on mds negacyclic lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "new constructions of mds codes with complementary duals"
    - "complementary dual algebraic geometry codes"
    - "lcd cyclic codes over finite fields"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

Connected through hyperedge HE-7 (induced by source paper "new characterization and parametrization of lcd codes"):
  with members:
    - "on sigma lcd codes"
    - "some bounds on binary lcd codes"
    - "euclidean and hermitian lcd mds codes"
    - "complementary dual algebraic geometry codes"
    - "lcd cyclic codes over finite fields"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

Connected through hyperedge HE-8 (induced by source paper "algebraic geometry codes with complementary duals exceed the asymptotic gilbert varshamov bound"):
  with members:
    - "some bounds on binary lcd codes"
    - "complementary dual algebraic geometry codes"
    - "lcd cyclic codes over finite fields"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

Question: Please tell me which class the center node 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)