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 "coding for linear operator channels over finite fields"):
  Abstract: Linear operator channels (LOCs) are motivated by the communications through networks employing random linear network coding (RLNC). Following the recent information theoretic results about LOCs, we propose two coding schemes for LOCs and evaluate their performance. These schemes can be used in networks employing RLNC without constraints on the network size and the field size. Our first scheme makes use of rank-metric codes and generalizes the rank-metric approach of subspace coding proposed by Silva et al. Our second scheme applies linear coding. The second scheme can achieve higher rate than the first scheme, while the first scheme has simpler decoding algorithm than the second scheme. Our coding schemes only require the knowledge of the expectation of the rank of the transformation matrix. The second scheme can also be realized ratelessly without any priori knowledge of the channel statistics.

Includes members:
  Member "on the capacity of non coherent network coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "batched sparse codes")
  Member "communication over finite field matrix channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite field matrix channels for network coding")
  Member "combinatiorial algorithms for wireless information flow":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compress and forward scheme for relay networks backword decoding and connection to bisubmodular flows")
  Member "multishot codes for network coding bounds and a multilevel construction":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reliable and secure multishot network coding using linearized reed solomon codes")
  Member "a rank metric approach to error control in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "roos bound for skew cyclic codes in hamming and rank metric")
  Member "network coding for distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "new bounds on the field size for maximally recoverable codes instantiating grid like topologies")
  Member "coding for errors and erasures in random network coding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the gap between scalar and vector solutions of generalized combination networks")
  Member "coding for network coding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "non binary ldpc codes with large alphabet size")

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)