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 "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.

Includes members:
  Member "a class of two weight and three weight codes and their applications in secret sharing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "weight distributions and weight hierarchies of two classes of binary linear codes")
  Member "hamming weights in irreducible cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a class of narrow sense bch 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)