human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on full diversity space time block codes with partial interference cancellation group decoding"
  Abstract: In this paper, we propose a partial interference cancellation (PIC) group decoding for linear dispersive space-time block codes (STBC) and a design criterion for the codes to achieve full diversity when the PIC group decoding is used at the receiver. A PIC group decoding decodes the symbols embedded in an STBC by dividing them into several groups and decoding each group separately after a linear PIC operation is implemented. It can be viewed as an intermediate decoding between the maximum likelihood (ML) receiver that decodes all the embedded symbols together, i.e., all the embedded symbols are in a single group, and the zero-forcing (ZF) receiver that decodes all the embedded symbols separately and independently, i.e., each group has and only has one embedded symbol, after the ZF operation is implemented. Our proposed design criterion for the PIC group decoding to achieve full diversity is an intermediate condition between the loosest ML full rank criterion of codewords and the strongest ZF linear independence condition of the column vectors in the equivalent channel matrix. We also propose asymptotically optimal (AO) group decoding algorithm, which is an intermediate decoding between the MMSE decoding algorithm and the ML decoding algorithm. The design criterion for the PIC group decoding applies to the AO group decoding algorithm. It is well-known that the symbol rate for a full rank linear STBC can be full, i.e., n_t for n_t transmit antennas. It has been recently shown that its rate is upper bounded by 1 if a code achieves full diversity with a linear receiver. The intermediate criterion proposed in this paper provides the possibility for codes of rates between n_t and 1 that achieve full diversity with a PIC group decoding. This therefore provides a complexity-performance-rate tradeoff.

Connected through hyperedge HE-1 (induced by source paper "achieving low complexity maximum likelihood detection for the 3d mimo code"):
  with members:
    - "a new family of low complexity stbcs for four transmit antennas"
    - "distributed mimo coding scheme with low decoding complexity for future mobile tv broadcasting"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"
    - "four group decodable space time block codes"
    - "fast maximum likelihood decoding of the golden code"
    - "3d mimo scheme for broadcasting future digital tv in single frequency networks"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-2 (induced by source paper "on low complexity full diversity detection in multi user mimo multiple access channels"):
  with members:
    - "on designs of full diversity space time block codes for two user mimo interference channels"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-3 (induced by source paper "full diversity space time block codes for integer forcing linear receivers"):
  with members:
    - "successive integer forcing and its sum rate optimality"
    - "precoded integer forcing universally achieves the mimo capacity to within a constant gap"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "integer forcing mimo linear receivers based on lattice reduction"
    - "diversity of mmse mimo receivers"
    - "integer forcing linear receivers"
    - "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"

Connected through hyperedge HE-4 (induced by source paper "on designs of full diversity space time block codes for two user mimo interference channels"):
  with members:
    - "high rate and full diversity space time block codes with low complexity partial interference cancellation group decoding"
    - "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"
    - "performance analysis of multiple antenna multi user detection"
    - "degrees of freedom of the k user m times n mimo interference channel"
    - "full diversity codes for miso systems equipped with linear or ml detectors"

Connected through hyperedge HE-5 (induced by source paper "an adaptive conditional zero forcing decoder with full diversity least complexity and essentially ml performance for stbcs"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "asymptotically optimal fast decodable full diversity stbcs"
    - "reduced ml decoding complexity full rate stbcs for 4 transmit antenna systems"
    - "fast maximum likelihood decoding of the golden code"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-6 (induced by source paper "spatial modulation in zero padded single carrier communication"):
  with members:
    - "low complexity maximum likelihood detection in spatial modulation systems"

Connected through hyperedge HE-7 (induced by source paper "energy efficient full diversity collaborative unitary space time block code design via unique factorization of signals"):
  with members:
    - "full diversity codes for miso systems equipped with linear or ml detectors"
    - "four group decodable space time block codes"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"
    - "the noncoherent rician fading channel part i structure of the capacity achieving input"
    - "noncoherent rician fading channel part ii spectral efficiency in the low power regime"

Connected through hyperedge HE-8 (induced by source paper "a new full diversity criterion and low complexity stbcs with partial interference cancellation decoding"):
  with members:
    - "fast group decodable stbcs via codes over gf 4"
    - "full diversity space time block codes with low complexity partial interference cancellation group decoding"
    - "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"
    - "four group decodable space time block codes"
    - "multi group ml decodable collocated and distributed space time block codes"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"
    - "multigroup decodable stbcs from clifford algebras"

Question: Please tell me which class the center node 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)