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: "euclidean and hermitian lcd mds codes"
  Abstract: Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is 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. On the other hand, being optimal codes, maximum distance separable codes (abbreviated MDS) have been of much interest from many researchers due to their theoretical significant and practical implications. However, little work has been done on LCD MDS codes. In particular, determining the existence of $q$-ary $[n,k]$ LCD MDS codes for various lengths $n$ and dimensions $k$ is a basic and interesting problem. In this paper, we firstly study the problem of the existence of $q$-ary $[n,k]$ LCD MDS codes and completely solve it for the Euclidean case. More specifically, we show that for $q>3$ there exists a $q$-ary $[n,k]$ Euclidean LCD MDS code, where $0\le k \le n\le q+1$, or, $q=2^{m}$, $n=q+2$ and $k= 3 \text{or} q-1$. Secondly, we investigate several constructions of new Euclidean and Hermitian LCD MDS codes. Our main techniques in constructing Euclidean and Hermitian LCD MDS codes use some linear codes with small dimension or codimension, self-orthogonal codes and generalized Reed-Solomon codes.

Connected through hyperedge HE-1 (induced by source paper "galois hulls of mds codes and their quantum error correction"):
  with members:
    - "euclidean and hermitian hulls of mds codes and their applications to eaqeccs"
    - "two new classes of quantum mds codes"
    - "new binary and ternary lcd codes"
    - "new characterization and parametrization of lcd codes"
    - "new constructions of mds codes with complementary duals"
    - "a construction of new quantum mds codes"

Connected through hyperedge HE-2 (induced by source paper "binary lcd codes and self orthogonal codes via simplicial complexes"):
  with members:
    - "some bounds on binary lcd codes"
    - "new characterization and parametrization of lcd codes"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-3 (induced by source paper "on euclidean hulls of mds codes"):
  with members:
    - "euclidean and hermitian hulls of mds codes and their applications to eaqeccs"
    - "new mds self dual codes over finite fields of odd characteristic"
    - "some new constructions of quantum mds codes"
    - "two new classes of quantum mds codes"
    - "new constructions of mds codes with complementary duals"
    - "new mds self dual codes from generalized reed solomon codes"
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-4 (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"
    - "linear codes over fq which are equivalent to lcd codes"
    - "constructions of optimal lcd codes over large finite fields"
    - "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-5 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist"):
  with members:
    - "structure and performance of generalized quasi cyclic codes"
    - "new characterization and parametrization of lcd codes"
    - "complementary dual subfield linear codes over finite fields"
    - "parameters of two classes of lcd bch codes"
    - "lcd cyclic codes over finite fields"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"
    - "matrix product codes over finite commutative frobenius rings"

Connected through hyperedge HE-6 (induced by source paper "minimal linear codes from characteristic functions"):
  with members:
    - "minimal linear codes arising from blocking sets"
    - "minimal linear codes over finite fields"
    - "complementary dual algebraic geometry codes"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "towards secure two party computation from the wire tap channel"

Connected through hyperedge HE-7 (induced by source paper "hulls of linear codes revisited with applications"):
  with members:
    - "galois hulls of linear codes over finite fields"
    - "new characterization and parametrization of lcd codes"
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "pure asymmetric quantum mds codes from css construction a complete characterization"
    - "euclidean and hermitian self orthogonal algebraic geometry codes and their application to quantum codes"

Connected through hyperedge HE-8 (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"
    - "linear codes over fq which are equivalent to lcd codes"
    - "constructions of optimal lcd codes over large finite fields"
    - "new characterization and parametrization of lcd codes"
    - "galois lcd codes over finite fields"

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)