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: "two new families of two weight codes"
  Abstract: We construct two new infinite families of trace codes of dimension    $2m$   , over the ring    $\mathbb {F}_{p}+u\mathbb {F}_{p}$   , with    $u^{2}=u$   , when    $p$    is an odd prime. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss sums. By Gray mapping, we obtain two infinite families of linear    $p$   -ary codes of respective lengths    $(p^{m}-1)^{2}$    and    $2(p^{m}-1)^{2}$   . When    $m$    is singly even, the first family gives five-weight codes. When    $m$    is odd and    $p\equiv 3 \pmod {4}$   , the first family yields    $p$   -ary two-weight codes, which are shown to be optimal by application of the Griesmer bound. The second family consists of two-weight codes that are shown to be optimal, by the Griesmer bound, whenever    $p=3$    and    $m \ge 3$   , or    $p\ge 5$    and    $m\ge 4$   . Applications to secret sharing schemes are given.

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"
    - "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"
    - "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:
    - "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 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 "optimal few weight codes from simplicial complexes"):
  with members:
    - "optimal three weight cubic codes"
    - "linear codes from some 2 designs"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"

Connected through hyperedge HE-4 (induced by source paper "few weight codes over bbb f_p u bbb f_p associated with down sets and their distance optimal gray image"):
  with members:
    - "linear codes from some 2 designs"
    - "weight distributions of cyclic codes with respect to pairwise coprime order elements"

Connected through hyperedge HE-5 (induced by source paper "on self dual and lcd double circulant and double negacirculant codes over mathbb f _q u mathbb f _q"):
  with members:
    - "on linear complementary dual multinegacirculant codes"
    - "on self dual four circulant codes"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

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)