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 "bounds on list decoding of rank metric codes"):
  Abstract: So far, there is no polynomial-time list decoding algorithm (beyond half the minimum distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of Reed-Solomon codes. In this paper, we provide bounds on the list size of rank-metric codes in order to understand whether polynomial-time list decoding is possible or whether it works only with exponential time complexity. Three bounds on the list size are proven. The first one is a lower exponential bound for Gabidulin codes and shows that for these codes no polynomial-time list decoding beyond the Johnson radius exists. Second, an exponential upper bound is derived, which holds for any rank-metric code of length n and minimum rank distance d. The third bound proves that there exists a rank-metric code over \BBFqm of length n ≤ m such that the list size is exponential in the length for any radius greater than half the minimum rank distance. This implies that there cannot exist a polynomial upper bound depending only on n and d similar to the Johnson bound in Hamming metric. All three rank-metric bounds reveal significant differences to bounds for codes in Hamming metric.

Includes members:
  Member "bounds for projective codes from semidefinite programming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semidefinite programming bounds for error correcting codes")
  Member "bounds on list decoding gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the list decodability of self orthogonal rank metric codes")
  Member "list decoding of subspace codes and rank metric codes up to singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "list and probabilistic unique decoding of folded subspace codes")
  Member "general linearized polynomial interpolation and its applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "list and probabilistic unique decoding of folded subspace codes")
  Member "recursive code construction for random networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "new constructions of subspace codes using subsets of mrd codes in several blocks")
  Member "fast encoding and decoding of gabidulin codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "decoding high order interleaved rank metric codes")
  Member "enumerative coding for grassmannian space":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the lattice structure of linear subspace codes")
  Member "error correcting codes in projective spaces via rank metric codes and ferrers diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a note on echelon ferrers construction")

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)