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 narrow sense bch codes"
  Abstract: BCH codes are an important class of cyclic codes which have applications in satellite communications, DVDs, disk drives, and two-dimensional bar codes. Although BCH codes have been widely studied, their parameters are known for only a few special classes. Recently, Ding et al. made some new progress in BCH codes. However, we still have very limited knowledge on the dimension of BCH codes, not to mention the weight distribution of BCH codes. In this paper, we generalize the results on BCH codes from several previous papers. #R##N#The dimension of narrow-sense BCH codes of length $\frac{q^m-1}{\lambda}$ with designed distance $2\leq \delta \leq \frac{q^{\lceil(m+1)/2 \rceil}-1}\lambda+1$ is settled, where $\lambda$ is any factor of $q-1$. #R##N#The weight distributions of two classes of narrow-sense BCH codes of length $\frac{q^m-1}2$ with designed distance $\delta=\frac{(q-1)q^{m-1}-q^{\lfloor(m-1)/2\rfloor}-1}2$ and $\delta=\frac{(q-1)q^{m-1}-q^{\lfloor(m+1)/2\rfloor}-1}2$ are determined. #R##N#The weight distribution of a class of BCH codes of length $\frac{q^m-1}{q-1}$ is determined. #R##N#In particular, a subclass of this class of BCH codes is optimal with respect to the Griesmer bound. Some optimal linear codes obtained from this class of BCH codes are characterized.

Connected through hyperedge HE-1 (induced by source paper "a class of narrow sense bch codes over mathbb f _q of length frac q m 1 2"):
  with members:
    - "the minimum distance of some narrow sense primitive bch codes"
    - "the dimension and minimum distance of two classes of primitive bch codes"
    - "dimensions of three types of bch codes over gf q"
    - "lcd cyclic codes over finite fields"
    - "a class of three weight cyclic codes"

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)