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 "roos bound for skew cyclic codes in hamming and rank metric"):
  Abstract: In this paper, a Roos like bound on the minimum distance for skew cyclic codes over a general field is provided. The result holds in the Hamming metric and in the rank metric. The proofs involve arithmetic properties of skew polynomials and an analysis of the rank of parity-check matrices. For the rank metric case, a way to arithmetically construct codes with a prescribed minimum rank distance, using the skew Roos bound, is also given. Moreover, some examples of MDS codes and MRD codes over finite fields are built, using the skew Roos bound.

Includes members:
  Member "skew polynomial rings and skew cyclic codes":
    also connected through other hyperedges:
      (none)
  Member "random construction of partial mds codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "generalized gabidulin codes over fields of any characteristic":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")
  Member "a sugiyama like decoding algorithm for convolutional codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "peterson gorenstein zierler algorithm for differential convolutional codes")
  Member "vector network coding based on subspace codes outperforms scalar linear network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "on the roots and minimum rank distance of skew cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "skew polynomial rings and skew cyclic codes")
  Member "optimal locally repairable and secure codes for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "generalization of gabidulin codes over fields of rational functions":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "equivalence and characterizations of linear rank metric codes based on invariants")

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)