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: "narrow sense bch codes over gf q with length n frac q m 1 q 1"
  Abstract: Cyclic codes over finite fields are widely employed in communication systems, storage devices and consumer electronics, as they have efficient encoding and decoding algorithms. BCH codes, as a special subclass of cyclic codes, are in most cases among the best cyclic codes. A subclass of good BCH codes are the narrow-sense BCH codes over $\gf(q)$ with length $n=(q^m-1)/(q-1)$. Little is known about this class of BCH codes when $q>2$. The objective of this paper is to study some of the codes within this class. In particular, the dimension, the minimum distance, and the weight distribution of some ternary BCH codes with length $n=(3^m-1)/2$ are determined in this paper. A class of ternary BCH codes meeting the Griesmer bound is identified. An application of some of the BCH codes in secret sharing is also investigated.

Connected through hyperedge HE-1 (induced by source paper "dimension of nonbinary antiprimitive bch codes"):
  with members:
    - "the dimension and minimum distance of two classes of primitive bch codes"
    - "dimensions of three types of bch codes over gf q"
    - "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-2 (induced by source paper "dimensions of three types of bch codes over gf q"):
  with members:
    - "the dimension and minimum distance of two classes of primitive bch codes"
    - "parameters of two classes of lcd bch codes"
    - "a family of reversible bch codes"
    - "lcd cyclic codes over finite fields"

Connected through hyperedge HE-3 (induced by source paper "parameters of two classes of lcd bch codes"):
  with members:
    - "complementary dual subfield linear codes over finite fields"
    - "a family of reversible bch codes"
    - "lcd cyclic codes over finite fields"
    - "the combinatorics of lcd codes linear programming bound and orthogonal matrices"

Connected through hyperedge HE-4 (induced by source paper "infinite families of 2 designs and 3 designs from linear codes"):
  with members:
    - "the dimension and minimum distance of two classes of primitive bch codes"
    - "hamming weights in irreducible 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)