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 "maximum distance separable codes for b symbol read channels"):
  Abstract: Recently, Yaakobi et al. introduced codes for $b$-symbol read channels, where the read operation is performed as a consecutive sequence of $b>2$ symbols. In this paper, we establish a Singleton-type bound on $b$-symbol codes. Codes meeting the Singleton-type bound are called maximum distance separable (MDS) codes, and they are optimal in the sense they attain the maximal minimum $b$-distance. Based on projective geometry and constacyclic codes, we construct new families of linear MDS $b$-symbol codes over finite fields. And in some sense, we completely determine the existence of linear MDS $b$-symbol codes over finite fields for certain parameters.

Includes members:
  Member "new constructions of mds symbol pair codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "symbol pair weight distributions of some linear codes")
  Member "constructions of maximum distance separable symbol pair codes using cyclic and constacyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "symbol pair weight distributions of some linear codes")
  Member "constacyclic symbol pair codes lower bounds and optimal constructions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "generalized pair weights of linear codes and macwilliams extension theorem")
  Member "maximum distance separable codes for symbol pair read channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "symbol pair weight distributions of some linear 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)