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 "some binary bch codes with length n 2 m 1"):
  Abstract: Abstract   Under research for nearly sixty years, Bose–Chaudhuri–Hocquenghem (BCH) codes have played increasingly important roles in many applications such as communication, data storage and information security. However, the dimension and minimum distance of BCH codes have been seldom solved by now because of their intractable characteristics. The objective of this paper is to study the dimensions of some binary BCH codes with length    n  =    2    m    +  1   . Many new techniques are employed to investigate the coset leaders modulo n. For    m  =  2  t  +  1  ,  4  t  +  2  ,  8  t  +  4    and    m  ≥  10   , the first five largest coset leaders modulo n are determined, and the dimensions of some BCH codes of length n with designed distance    δ  >    2    ⌈    m    2    ⌉      are presented. These new skills and results may be helpful to study other types of cyclic codes over finite fields.

Includes members:
  Member "the dimension and minimum distance of two classes of primitive bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a class of narrow sense bch codes")
  Member "dimensions of three types of bch codes over gf q":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a class of narrow sense bch codes")
  Member "parameters of two classes of lcd bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "do non free lcd codes over finite commutative frobenius rings exist")
  Member "the reversible negacyclic codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "euclidean and hermitian lcd mds codes")
  Member "lcd cyclic codes over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "self reciprocal and self conjugate reciprocal irreducible factors of x n lambda and their applications")

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)