human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "new list decoding algorithms for reed solomon and bch codes"
  Abstract: In this paper we devise a rational curve fitting algorithm and apply it to the list decoding of Reed-Solomon and BCH codes. The proposed list decoding algorithms exhibit the following significant properties. 1 The algorithm corrects up to $n(1-\sqrt{1-D})$ errors for a (generalized) $(n, k, d=n-k+1)$ Reed-Solomon code, which matches the Johnson bound, where $D\eqdef \frac{d}{n}$ denotes the normalized minimum distance. In comparison with the Guruswami-Sudan algorithm, which exhibits the same list correction capability, the former requires multiplicity, which dictates the algorithmic complexity, $O(n(1-\sqrt{1-D}))$, whereas the latter requires multiplicity $O(n^2(1-D))$. With the up-to-date most efficient implementation, the former has complexity $O(n^{6}(1-\sqrt{1-D})^{7/2})$, whereas the latter has complexity $O(n^{10}(1-D)^4)$. 2. With the multiplicity set to one, the derivative list correction capability precisely sits in between the conventional hard-decision decoding and the optimal list decoding. Moreover, the number of candidate codewords is upper bounded by a constant for a fixed code rate and thus, the derivative algorithm exhibits quadratic complexity $O(n^2)$. 3. By utilizing the unique properties of the Berlekamp algorithm, the algorithm corrects up to $\frac{n}{2}(1-\sqrt{1-2D})$ errors for a narrow-sense $(n, k, d)$ binary BCH code, which matches the Johnson bound for binary codes. The algorithmic complexity is $O(n^{6}(1-\sqrt{1-2D})^7)$.

Connected through hyperedge HE-1 (induced by source paper "reed solomon codes over fields of characteristic zero"):
  with members:
    - "generalized gabidulin codes over fields of any characteristic"
    - "low rank matrix recovery using gabidulin codes in characteristic zero"
    - "guruswami sudan list decoding for complex reed solomon codes"
    - "an alternative decoding method for gabidulin codes in characteristic zero"
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"

Connected through hyperedge HE-2 (induced by source paper "improved power decoding of interleaved one point hermitian codes"):
  with members:
    - "improved power decoding of one point hermitian codes"
    - "decoding of interleaved reed solomon codes using improved power decoding"
    - "sub quadratic decoding of one point hermitian codes"
    - "unique decoding of general ag codes"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"
    - "collaborative decoding of interleaved reed solomon codes and concatenated code designs"

Connected through hyperedge HE-3 (induced by source paper "algebraic soft decoding of reed solomon codes using module minimization"):
  with members:
    - "power decoding reed solomon codes up to the johnson radius"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "multi trial guruswami sudan decoding for generalised reed solomon codes"
    - "on rational interpolation based list decoding and list decoding binary goppa codes"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"
    - "the re encoding transformation in algebraic list decoding of reed solomon codes"
    - "syndrome decoding of reed solomon codes beyond half the minimum distance based on shift register synthesis"

Connected through hyperedge HE-4 (induced by source paper "an iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings"):
  with members:
    - "a parametric approach to list decoding of reed solomon codes using interpolation"
    - "minimal polynomial algorithms for finite sequences"
    - "minimal gr obner bases and the predictable leading monomial property"
    - "on minimality of convolutional ring encoders"

Connected through hyperedge HE-5 (induced by source paper "fast computation of the roots of polynomials over the ring of power series"):
  with members:
    - "sub quadratic decoding of one point hermitian codes"

Connected through hyperedge HE-6 (induced by source paper "power decoding reed solomon codes up to the johnson radius"):
  with members:
    - "fast computation of shifted popov forms of polynomial matrices via systems of modular polynomial equations"
    - "algorithms for simultaneous pade approximations"
    - "sub quadratic decoding of one point hermitian codes"
    - "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"
    - "coding for combined block symbol error correction"
    - "power decoding of reed solomon codes revisited"
    - "generalised multi sequence shift register synthesis using module minimisation"
    - "on rational interpolation based list decoding and list decoding binary goppa codes"

Connected through hyperedge HE-7 (induced by source paper "faster algorithms for multivariate interpolation with multiplicities and simultaneous polynomial approximations"):
  with members:
    - "powers of tensors and fast matrix multiplication"
    - "on rational interpolation based list decoding and list decoding binary goppa codes"
    - "an interpolation procedure for list decoding reed solomon codes based on generalized key equations"
    - "the re encoding transformation in algebraic list decoding of reed solomon codes"
    - "efficient interpolation in the guruswami sudan algorithm"
    - "explicit codes achieving list decoding capacity error correction with optimal redundancy"

Connected through hyperedge HE-8 (induced by source paper "new algebraic soft decision decoding algorithm for reed solomon code"):
  with members:
    - "the re encoding transformation in algebraic list decoding of reed solomon codes"

Question: Please tell me which class the center node 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)