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: "new characterization and parametrization of lcd codes"
  Abstract: Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD codes. In particular, it has been shown that binary LCD codes play an important role in implementations against side-channel attacks and fault injection attacks. In this paper, we first present a new characterization of binary LCD codes in terms of their symplectic basis. Using such a characterization,we solve a conjecture proposed by Galvez et al. on the minimum distance of binary LCD codes. Next, we consider the action of the orthogonal group on the set of all LCD codes, determine all possible orbits of this action, derive simple closed formulas of the size of the orbits, and present some asymptotic results of the size of the corresponding orbits. Our results show that almost all binary LCD codes are odd-like codes with odd-like duals, and about half of q-ary LCD codes have orthonormal basis, where q is a power of an odd prime.

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"
    - "euclidean and hermitian lcd mds codes"
    - "new binary and ternary 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"
    - "euclidean and hermitian lcd mds codes"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-3 (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"
    - "euclidean and hermitian lcd mds 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-4 (induced by source paper "linear complementary dual maximum distance separable codes"):
  with members:
    - "coding theory the unit derived methodology"
    - "linear codes over fq which are equivalent to 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-5 (induced by source paper "hulls of linear codes revisited with applications"):
  with members:
    - "galois hulls of linear codes over finite fields"
    - "euclidean and hermitian lcd mds 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-6 (induced by source paper "remark on subcodes of linear complementary dual codes"):
  with members:
    - "some bounds on binary lcd codes"

Connected through hyperedge HE-7 (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"
    - "euclidean and hermitian lcd mds codes"
    - "galois lcd codes over finite fields"

Connected through hyperedge HE-8 (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"
    - "linear codes over fq which are equivalent to lcd codes"
    - "euclidean and hermitian lcd mds 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"

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)