human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "linear codes with two or three weights from weakly regular bent functions"
  Abstract: Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of constructing two-weight and three-weight linear codes of Ding et al. \cite{DD2015} and Zhou et al. \cite{ZLFH2015} to general weakly regular bent functions and determines the weight distributions of these linear codes. It solves the open problem of Ding et al. \cite{DD2015}. Further, this paper constructs new linear codes with two or three weights and presents the weight distributions of these codes. They contains some optimal codes meeting certain bound on linear codes.

Connected through hyperedge HE-1 (induced by source paper "minimal linear codes constructed from functions"):
  with members:
    - "the parameters of minimal linear codes"
    - "minimal linear codes from characteristic functions"
    - "minimal linear codes over finite fields"
    - "two new families of two weight codes"
    - "complete weight enumerators of a family of three weight linear codes"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from a generic construction"
    - "linear codes from some 2 designs"

Connected through hyperedge HE-2 (induced by source paper "full characterization of minimal linear codes as cutting blocking sets"):
  with members:
    - "an inductive construction of minimal codes"
    - "minimal linear codes arising from blocking sets"
    - "the parameters of minimal linear codes"
    - "minimal linear codes from characteristic functions"
    - "minimal linear codes over finite fields"
    - "a new class of three weight linear codes from weakly regular plateaued functions"
    - "it is indeed a fundamental construction of all linear codes"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-3 (induced by source paper "several classes of two weight and three weight linear codes"):
  with members:
    - "two weight and three weight linear codes based on weil sums"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of three weight and five weight linear codes"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a class of three weight cyclic codes"

Connected through hyperedge HE-4 (induced by source paper "the parameters of minimal linear codes"):
  with members:
    - "two new families of two weight codes"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from a generic construction"
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "towards secure two party computation from the wire tap channel"

Connected through hyperedge HE-5 (induced by source paper "two weight and three weight linear codes based on weil sums"):
  with members:
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"

Connected through hyperedge HE-6 (induced by source paper "the parameters of a family of linear codes"):
  with members:
    - "infinite families of 2 designs and 3 designs from linear codes"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-7 (induced by source paper "a class of three weight linear codes and their complete weight enumerators"):
  with members:
    - "complete weight enumerators of a family of three weight linear codes"
    - "complete weight enumerators of two classes of linear codes"
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a family of five weight cyclic codes and their weight enumerators"
    - "hamming weights in irreducible cyclic codes"
    - "the weight distributions of cyclic codes and elliptic curves"

Connected through hyperedge HE-8 (induced by source paper "on some exponential sums related to the coulter s polynomial"):
  with members:
    - "on the dual of the coulter matthews bent functions"
    - "complete weight enumerators of two classes of linear codes"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Question: Please tell me which class the center node 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)