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 "new constructions of mds codes with complementary duals"):
  Abstract: Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This application of LCD codes renewed the interest in the construction of LCD codes having a large minimum distance. MDS codes are optimal in the sense that the minimum distance cannot be improved for given length and code size. Constructing LCD MDS codes is thus of significance in theory and practice. Recently, Jin (\cite{Jin}, IEEE Trans. Inf. Theory, 2016) constructed several classes of LCD MDS codes through generalized Reed-Solomon codes. In this paper, a different approach is proposed to obtain new LCD MDS codes from generalized Reed-Solomon codes. Consequently, new code constructions are provided and certain previously known results in \cite{Jin} are extended.

Includes members:
  Member "on mds negacyclic lcd codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "some new bounds on lcd codes over finite fields")
  Member "new mds self dual codes from generalized reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "constructions of quantum mds codes")
  Member "complementary dual algebraic geometry codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist")
  Member "the reversible negacyclic codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "some binary bch codes with length n 2 m 1")
  Member "a family of reversible bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "euclidean and hermitian lcd mds codes")
  Member "lcd cyclic codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "self reciprocal and self conjugate reciprocal irreducible factors of x n lambda and their applications")
  Member "the combinatorics of lcd codes linear programming bound and orthogonal matrices":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "binary lcd codes from mathbb z _2 mathbb z _2 u")

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)