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 "evaluation of the hamming weights of a class of linear codes based on gauss sums"):
  Abstract: Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power of a prime. The lower bound of its minimum Hamming distance is obtained. In some special cases, we evaluate the weight distributions of the linear codes by semi-primitive Gauss sums and obtain some one-weight, two-weight linear codes. It is quite interesting that we find new optimal codes achieving some bounds on linear codes. The linear codes in this paper can be used in secret sharing schemes, authentication codes and data storage systems.

Includes members:
  Member "a construction of linear codes over f_ 2 t from boolean functions":
    also connected through other hyperedges:
      (none)
  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 "a construction of binary linear codes from boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "minimal linear codes constructed from functions")
  Member "linear codes from a generic construction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "minimal linear codes constructed from functions")
  Member "several classes of cyclic codes with either optimal three weights or a few weights":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a class of functions with low valued walsh spectrum")
  Member "linear codes from some 2 designs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "linear codes with two or three weights from quadratic bent functions":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "several classes of two weight and three weight linear codes")
  Member "a class of three weight and five weight linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "several classes of two weight and three weight linear 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)