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 "analog subspace coding a new approach to coding for non coherent wireless networks"):
  Abstract: We provide a precise framework to study subspace codes for non-coherent communications in wireless networks. To this end, an \textit{analog operator channel} is defined with inputs and outputs being subspaces of $\C^n$. Then a certain distance metric is defined to capture the performance of subspace codes in terms of their capability to recover from interference and rank-deficiency of the network. We also study the robustness of the proposed model with respect to an additive noise. Furthermore, we propose a new approach to construct subspace codes in the analog domain, also regarded as Grassmann codes, by leveraging polynomial evaluations over finite fields together with characters associated to finite fields that map their elements to the unit circle in the complex plane. The constructed codes are shown to perform better comparing to other existing constructions of Grassmann codes for a wide range of values for $n$.

Includes members:
  Member "algorithms for enhanced inter cell interference coordination eicic in lte hetnets":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "security reliability tradeoff for distributed antenna systems in heterogeneous cellular networks")
  Member "list decoding subspace codes from insertions and deletions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity upper bounds for deletion type channels")
  Member "algebraic list decoding of subspace codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "maximal ferrers diagram codes constructions and genericity considerations")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "distance properties of expander codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "linear time erasure list decoding of expander codes")

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)