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 from a generic construction"
  Abstract: A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach. The first objective of this paper is to establish relationships among some classes of linear codes obtained with this approach, so that the parameters of some classes of linear codes can be derived from those of other classes with known parameters. In this way, linear codes with new parameters will be derived. The second is to present a class of three-weight binary codes and consider their applications in secret sharing.

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 some 2 designs"
    - "linear codes with two or three weights from weakly regular bent functions"

Connected through hyperedge HE-2 (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 some 2 designs"
    - "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"
    - "towards secure two party computation from the wire tap channel"

Connected through hyperedge HE-3 (induced by source paper "a family of linear codes with three weights"):
  with members:
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "five families of three weight ternary cyclic codes and their duals"

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"
    - "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"
    - "a class of three weight and five weight linear codes"
    - "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 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 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"

Connected through hyperedge HE-6 (induced by source paper "linear codes with two or three weights from some functions with low walsh spectrum in odd characteristic"):
  with members:
    - "several classes of bent near bent and 2 plateaued functions over finite fields of odd characteristic"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "evaluation of the weight distribution of a class of linear codes based on semi primitive gauss sums"):
  with members:
    - "a construction of binary linear codes from boolean functions"
    - "linear codes from some 2 designs"
    - "a class of two weight and three weight codes and their applications in secret sharing"
    - "five families of three weight ternary cyclic codes and their duals"

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)