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 "simultaneous partial inverses and decoding interleaved reed solomon codes"):
  Abstract: The paper introduces the simultaneous partial-inverse problem (SPI) for polynomials and develops its application to decoding interleaved Reed--Solomon codes beyond half the minimum distance. While closely related both to standard key equations and to well-known Pade approximation problems, the SPI problem stands out in several respects. First, the SPI problem has a unique solution (up to a scale factor), which satisfies a natural degree bound. Second, the SPI problem can be transformed (monomialized) into an equivalent SPI problem where all moduli are monomials. Third, the SPI problem can be solved by an efficient algorithm of the Berlekamp--Massey type. Fourth, decoding interleaved Reed--Solomon codes (or subfield-evaluation codes) beyond half the minimum distance can be analyzed in terms of a partial-inverse condition for the error pattern: if that condition is satisfied, then the (true) error locator polynomial is the unique solution of a standard key equation and can be computed in many different ways, including the well-known multi-sequence Berlekamp--Massey algorithm and the SPI algorithm of this paper. Two of the best performance bounds from the literature (the Schmidt--Sidorenko--Bossert bound and the Roth--Vontobel bound) are generalized to hold for the partial-inverse condition and thus to apply to several different decoding algorithms.

Includes members:
  Member "decoding of interleaved reed solomon codes using improved power decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "enhancing simultaneous rational function recovery adaptive error correction capability and new bounds for applications")
  Member "algorithms for simultaneous pade approximations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "enhancing simultaneous rational function recovery adaptive error correction capability and new bounds for applications")
  Member "coding for combined block symbol error correction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "generalised multi sequence shift register synthesis using module minimisation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on error decoding of locally repairable and partial mds codes")
  Member "reduced complexity collaborative decoding of interleaved reed solomon and gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar like codes and asymptotic tradeoff among block length code rate and error probability")
  Member "collaborative decoding of interleaved reed solomon codes and concatenated code designs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "enhancing simultaneous rational function recovery adaptive error correction capability and new bounds for 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)