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 "delay complexity trade off of random linear network coding in wireless broadcast"):
  Abstract: In wireless broadcast, random linear network coding (RLNC) over GF($2^L$) is known to asymptotically achieve the optimal completion delay with increasing $L$. However, the high decoding complexity hinders the potential applicability of RLNC schemes over large GF($2^L$). In this paper, a comprehensive analysis of completion delay and decoding complexity is conducted for field-based systematic RLNC schemes in wireless broadcast. In particular, we prove that the RLNC scheme over GF(2) can also asymptotically approach the optimal completion delay per packet when the packet number goes to infinity. Moreover, we introduce a new method, based on circular-shift operations, to design RLNC schemes which avoid multiplications over large GF($2^L$). Based on both theoretical and numerical analyses, the new RLNC schemes turn out to have a much better trade-off between completion delay and decoding complexity. In particular, numerical results demonstrate that the proposed schemes can attain average completion delay just within 5% higher than the optimal one, while the decoding complexity is within 3 times the one of the RLNC scheme over GF(2).

Includes members:
  Member "circular shift linear network coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "circular shift linear network codes with arbitrary odd block lengths")
  Member "circular shift linear network codes with arbitrary odd block lengths":
    also connected through other hyperedges:
      (none)
  Member "approximating throughput and packet decoding delay in linear network coded wireless broadcast":
    also connected through other hyperedges:
      (none)
  Member "decoding delay performance of random linear network coding for broadcast":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "random linear network coding for 5g mobile video delivery")
  Member "optimal control for network coding broadcast":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "delay optimal scheduling for chunked random linear network coding broadcast")
  Member "on vector linear solvability of multicast networks":
    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 "decoding and file transfer delay balancing in network coding broadcast":
    also connected through other hyperedges:
      (none)
  Member "completion delay minimization for instantly decodable network codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "coalition formation game for delay reduction in instantly decodable network coding assisted d2d communications")

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)