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 "list decoding of lifted gabidulin codes via the plucker embedding"):
  Abstract: Codes in the Grassmannian have recently found an application in random network coding. All the codewords in such codes are subspaces of $\F_q^n$ with a given dimension. #R##N#In this paper, we consider the problem of list decoding of a certain family of codes in the Grassmannian, called lifted Gabidulin codes. #R##N#For this purpose we use the Pl\"ucker embedding of the Grassmannian. We describe a way of representing a subset of the Pl\"ucker coordinates of lifted Gabidulin codes as linear block codes. The union of the parity-check equations of these block codes and the equations which arise from the description of a ball around a subspace in the Pl\"ucker coordinates describe the list of codewords with distance less than a given parameter from the received word.

Includes members:
  Member "cyclic orbit codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the lattice structure of linear subspace 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 subspace codes from insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "analog subspace coding a new approach to coding for non coherent wireless networks")
  Member "decoding of subspace codes a problem of schubert calculus over finite fields":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes")
  Member "list decoding of subspace codes and rank metric codes up to singleton bound":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "list and probabilistic unique decoding of folded subspace codes")
  Member "plucker embedding of cyclic orbit codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the geometry of balls in the grassmannian and list decoding of lifted gabidulin codes")
  Member "new improvements on the echelon ferrers construction":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "construction of subspace codes through linkage")
  Member "codes and designs related to lifted mrd codes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal binary locally repairable codes via anticodes")

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)