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 "reed solomon codes over fields of characteristic zero"):
  Abstract: We study Reed--Solomon codes over arbitrary fields, inspired by several recent papers dealing with Gabidulin codes over fields of characteristic zero. Over the field of rational numbers, we derive bounds on the coefficient growth during encoding and the bit complexity of decoding, which is polynomial in the code length and in the bit width of error and codeword values. The results can be generalized to arbitrary number fields.

Includes members:
  Member "generalized gabidulin codes over fields of any characteristic":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "low rank matrix recovery using gabidulin codes in characteristic zero":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "systematic encoders for generalized gabidulin codes and the q analogue of cauchy matrices")
  Member "guruswami sudan list decoding for complex reed solomon codes":
    also connected through other hyperedges:
      (none)
  Member "an alternative decoding method for gabidulin codes in characteristic zero":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "low rank matrix recovery using gabidulin codes in characteristic zero")
  Member "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "new list decoding algorithms for reed solomon and bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "improved power decoding of interleaved one point hermitian 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)