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: "a class of three weight and five weight linear codes"
  Abstract: Recently, linear codes with few weights have been widely studied, since they have applications in data storage systems, communication systems and consumer electronics. In this paper, we present a class of three-weight and five-weight linear codes over Fp, where p is an odd prime and Fp denotes a finite field with p elements. The weight distributions of the linear codes constructed in this paper are also settled. Moreover, the linear codes illustrated in the paper may have applications in secret sharing schemes.

Connected through hyperedge HE-1 (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"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "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-2 (induced by source paper "a construction of linear codes and their complete weight enumerators"):
  with members:
    - "a class of three weight linear codes and their complete weight enumerators"
    - "complete weight enumerators of a family of three weight linear codes"
    - "complete weight enumerators of some linear codes"
    - "complete weight enumerators of two classes of linear codes"
    - "linear codes from some 2 designs"
    - "a class of linear codes with three weights"
    - "a class of two weight and three weight codes and their applications in secret sharing"

Connected through hyperedge HE-3 (induced by source paper "linear codes with a few weights from inhomogeneous quadratic functions"):
  with members:
    - "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"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "a class of linear codes with a few weights"

Connected through hyperedge HE-4 (induced by source paper "evaluation of the hamming weights of a class of linear codes based on gauss sums"):
  with members:
    - "a construction of linear codes over f_ 2 t from boolean functions"
    - "a characterization of a class of optimal three weight cyclic codes of dimension 3 over any finite field"
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from a generic construction"
    - "several classes of cyclic codes with either optimal three weights or a few weights"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "linear codes with two or three weights from weakly regular bent functions"

Connected through hyperedge HE-5 (induced by source paper "a class of linear codes with a few weights"):
  with members:
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from a generic construction"
    - "linear codes from some 2 designs"
    - "linear codes with two or three weights from quadratic bent functions"
    - "a class of linear codes with three weights"
    - "linear codes with two or three weights from weakly regular bent functions"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "lossy compression via sparse linear regression computationally efficient encoding and decoding"

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)