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 "on squares of cyclic codes"):
  Abstract: The square    $C^{*2}$    of a linear error correcting code    $C$    is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in    $C$   . Squares of codes have gained attention for several applications mainly in the area of cryptography, and typically in those applications, one is concerned about some of the parameters (dimension and minimum distance) of both    $C^{*2}$    and    $C$   . In this paper, motivated mostly by the study of this problem in the case of linear codes defined over the binary field, squares of cyclic codes are considered. General results on the minimum distance of the squares of cyclic codes are obtained, and constructions of cyclic codes    $C$    with a relatively large dimension of    $C$    and minimum distance of the square    $C^{*2}$    are discussed. In some cases, the constructions lead to codes    $C$    such that both    $C$    and    $C^{*2}$    simultaneously have the largest possible minimum distances for their length and dimensions.

Includes members:
  Member "critical pairs for the product singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "squares of matrix product codes")
  Member "squares of random linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "squares of matrix product codes")
  Member "polynomial time attack on wild mceliece over quadratic extensions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "squares of matrix product codes")
  Member "an upper bound of singleton type for componentwise products of linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "squares of matrix product codes")
  Member "on products and powers of linear codes under componentwise multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "squares of matrix product codes")
  Member "asymptotically good binary linear codes with asymptotically good self intersection spans":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "squares of matrix product codes")

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)