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 "an extended characterization of a class of optimal three weight cyclic codes over any finite field"):
  Abstract: A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization was given in [3]. The main purpose of this work is to show that the numerical conditions found in [3], are also necessary. As we will see later, an interesting feature of the present work, in clear contrast with these two preceding works, is that we use some new and non-conventional methods in order to achieve our goals. In fact, through these non-conventional methods, we not only were able to extend the characterization in [10], but also present a less complex proof of such extended characterization, which avoids the use of some of the sophisticated --but at the same time complex-- theorems, that are the key arguments of the proofs given in [10] and [3]. Furthermore, we also find the parameters for the dual code of any cyclic code in our extended characterization class. In fact, after the analysis of some examples, it seems that such dual codes always have the same parameters as the best known linear codes.

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 "evaluation of the hamming weights of a class of linear codes based on gauss sums")
  Member "several classes of cyclic codes with either optimal three weights or a few weights":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a class of functions with low valued walsh spectrum")

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)