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 "low ml decoding complexity stbcs via codes over gf 4"):
  Abstract: In this paper, we give a new framework for con- structing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field F4. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full-diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over F4, for number of transmit antennas N = 2 m , m � 1, and rates R > 1 complex symbols per channel use. When R = N , the new STBCs are information-lossless as well. The new class of STBCs have the least known ML decoding complexity among all the codes available in the literature for a large set of (N,R) pairs 1 . I. I NTRODUCTION

Includes members:
  Member "asymptotically optimal fast decodable full diversity stbcs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "an adaptive conditional zero forcing decoder with full diversity least complexity and essentially ml performance for stbcs")
  Member "four group decodable space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "fast maximum likelihood decoding of the golden code":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "on the search for high rate quasi orthogonal space time block code":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras")
  Member "on fast decodable space time block codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")
  Member "algebraic distributed differential space time codes with low decoding complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a belief propagation based framework for soft multiple symbol differential detection")
  Member "quasi orthogonal stbc with minimum decoding complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")

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)