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 binary and ternary lcd codes"
  Abstract: LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality larger than 3. Hence, the study of LCD codes is mainly open for binary and ternary fields. Subfield-subcodes of $J$-affine variety codes are a generalization of BCH codes which have been successfully used for constructing good quantum codes. We describe binary and ternary LCD codes constructed as subfield-subcodes of $J$-affine variety codes and provide some new and good LCD codes coming from this construction.

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 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 "locally recoverable j affine variety codes"):
  with members:
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "how long can optimal locally repairable codes be"
    - "classical and quantum evaluation codes at the trace roots"
    - "on the distance of stabilizer quantum codes from j affine variety codes"
    - "constructions of optimal cyclic r delta locally repairable codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"
    - "cooperative local repair in distributed storage"
    - "cyclic lrc codes and their subfield subcodes"

Connected through hyperedge HE-3 (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"
    - "euclidean and hermitian lcd mds 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-4 (induced by source paper "entanglement assisted quantum error correcting codes over arbitrary finite fields"):
  with members:
    - "constructions of good entanglement assisted quantum error correcting codes"
    - "stabilizer quantum codes from j affine variety codes and a new steane like enlargement"

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)