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 "improved power decoding of interleaved one point hermitian codes"):
  Abstract: We propose a new partial decoding algorithm for $h$-interleaved one-point Hermitian codes that can decode-under certain assumptions-an error of relative weight up to $1-(\tfrac{k+g}{n})^{\frac{h}{h+1}}$, where $k$ is the dimension, $n$ the length, and $g$ the genus of the code. Simulation results for various parameters indicate that the new decoder achieves this maximal decoding radius with high probability. The algorithm is based on a recent generalization of Rosenkilde's improved power decoder to interleaved Reed-Solomon codes, does not require an expensive root-finding step, and improves upon the previous best decoding radius by Kampf at all rates. In the special case $h=1$, we obtain an adaption of the improved power decoding algorithm to one-point Hermitian codes, which for all simulated parameters achieves a similar observed failure probability as the Guruswami-Sudan decoder above the latter's guaranteed decoding radius.

Includes members:
  Member "improved power decoding of one point hermitian codes":
    also connected through other hyperedges:
      (none)
  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 "sub quadratic decoding of one point hermitian codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants")
  Member "unique decoding of general ag codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "list decoding algorithm based on voting in grobner bases for general one point ag 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 "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "reed solomon codes over fields of characteristic zero")
  Member "collaborative decoding of interleaved reed solomon codes and concatenated code designs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)