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: "dimensions of three types of bch codes over gf q"
  Abstract: BCH codes have been studied for over fifty years and widely employed in consumer devices, communication systems, and data storage systems. However, the dimension of BCH codes is settled only for a very small number of cases. In this paper, we study the dimensions of BCH codes over finite fields with three types of lengths $n$, namely $n=q^m-1$, $n=(q^m-1)/(q-1)$ and $n=q^m+1$. For narrow-sense primitive BCH codes with designed distance $\delta$, we investigate their dimensions for $\delta$ in the range $1\le \delta \le q^{\lceil\frac{m}{2}\rceil+1}$. For non-narrow sense primitive BCH codes, we provide two general formulas on their dimensions and give the dimensions explicitly in some cases. Furthermore, we settle the minimum distances of some primitive BCH codes. We also explore the dimensions of the BCH codes of lengths $n=(q^m-1)/(q-1)$ and $n=q^m+1$ over finite fields.

Connected through hyperedge HE-1 (induced by source paper "a class of narrow sense bch codes"):
  with members:
    - "dimensions of nonbinary antiprimitive bch codes and some conjectures"
    - "dimension of nonbinary antiprimitive bch codes"
    - "the minimum distance of some narrow sense primitive bch codes"
    - "the dimension and minimum distance of two classes of primitive bch codes"
    - "lcd cyclic codes over finite fields"
    - "a class of three weight cyclic codes"
    - "hamming weights in irreducible cyclic codes"
    - "exponential sums cyclic codes and sequences the odd characteristic kasami case"

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

Connected through hyperedge HE-3 (induced by source paper "some binary bch codes with length n 2 m 1"):
  with members:
    - "the dimension and minimum distance of two classes of primitive bch codes"
    - "parameters of two classes of lcd bch codes"
    - "the reversible negacyclic codes over finite fields"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-4 (induced by source paper "dimension of nonbinary antiprimitive bch codes"):
  with members:
    - "the dimension and minimum distance of two classes of primitive bch codes"
    - "parameters of two classes of lcd bch codes"
    - "narrow sense bch codes over gf q with length n frac q m 1 q 1"
    - "the reversible negacyclic codes over finite fields"
    - "lcd cyclic codes over finite fields"

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)