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 "explicit rank metric codes list decodable with optimal redundancy"):
  Abstract: We construct an explicit family of linear rank-metric codes over any field ${\mathbb F}_h$ that enables efficient list decoding up to a fraction $\rho$ of errors in the rank metric with a rate of $1-\rho-\epsilon$, for any desired $\rho \in (0,1)$ and $\epsilon > 0$. Previously, a Monte Carlo construction of such codes was known, but this is in fact the first explicit construction of positive rate rank-metric codes for list decoding beyond the unique decoding radius. #R##N#Our codes are subcodes of the well-known Gabidulin codes, which encode linearized polynomials of low degree via their values at a collection of linearly independent points. The subcode is picked by restricting the message polynomials to an ${\mathbb F}_h$-subspace that evades the structured subspaces over an extension field ${\mathbb F}_{h^t}$ that arise in the linear-algebraic list decoder for Gabidulin codes due to Guruswami and Xing (STOC'13). This subspace is obtained by combining subspace designs contructed by Guruswami and Kopparty (FOCS'13) with subspace evasive varieties due to Dvir and Lovett (STOC'12). #R##N#We establish a similar result for subspace codes, which are a collection of subspaces, every pair of which have low-dimensional intersection, and which have received much attention recently in the context of network coding. We also give explicit subcodes of folded Reed-Solomon (RS) codes with small folding order that are list-decodable (in the Hamming metric) with optimal redundancy, motivated by the fact that list decoding RS codes reduces to list decoding such folded RS codes. However, as we only list decode a subcode of these codes, the Johnson radius continues to be the best known error fraction for list decoding RS codes.

Includes members:
  Member "bounds on list decoding of rank metric codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "list decoding subspace codes from insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analog subspace coding a new approach to coding for non coherent wireless networks")
  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 "folded codes from function field towers and improved optimal rate list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "linear time erasure list decoding of expander codes")
  Member "on identity testing of tensors low rank recovery and compressed sensing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lower bounds for matrix factorization")
  Member "subspace evasive sets":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes")
  Member "error correcting codes in projective spaces via rank metric codes and ferrers diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a note on echelon ferrers construction")
  Member "a rank metric approach to error control in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")

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)