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 "several classes of cyclic codes with either optimal three weights or a few weights"):
  Abstract: Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction of cyclic codes. As applications, we obtain a class of optimal three-weight codes achieving the Griesmer bound, which generalizes a Vega's result in \cite{V1}, and several classes of cyclic codes with only a few weights, which solve the open problem in \cite{V1}.

Includes members:
  Member "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an extended characterization of a class of optimal three weight cyclic codes over any finite field")
  Member "linear codes from some 2 designs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "weight distributions of cyclic codes with respect to pairwise coprime order elements":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a class of functions with low valued walsh spectrum")
  Member "a class of three weight cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a class of narrow sense bch codes")
  Member "on the weight distributions of several classes of cyclic codes from apn monomials":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field")
  Member "a characterization of two weight projective cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field")
  Member "hamming weights in irreducible cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a class of narrow sense bch 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)