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: "full diversity codes for miso systems equipped with linear or ml detectors"
  Abstract: In this paper, a general criterion for space-time block codes (STBC) to achieve full diversity with a linear receiver is proposed for a wireless communication system having multiple transmitter and single receiver antennas [multiple-input-single-output (MISO)]. Particularly, the STBC with Toeplitz structure satisfies this criterion, and therefore, enables full diversity. Further examination of this Toeplitz STBC reveals the following important properties: (1) the symbol transmission rate can be made to approach unity; (2) applying the Toeplitz code to any signalling scheme having nonzero distance between the nearest constellation points results in a nonvanishing determinant. In addition, if quadratic-amplitude modulation (QAM) is used as the signalling scheme, then for independent MISO flat-fading channels, the Toeplitz codes is proved to approach the optimal diversity-versus-multiplexing tradeoff with a zero-forcing (ZF) receiver when the number of channel uses is large. This is, so far, the first nonorthogonal STBC shown to achieve the optimal tradeoff for such a receiver. On the other hand, when maximum-likelihood (ML) detection is employed in a MISO system, the Toeplitz STBC achieves the maximum coding gain for independent channels. When the channel fading coefficients are correlated, the inherent transmission matrix in the Toeplitz STBC can be designed to minimize the average worst case pairwise error probability.

Connected through hyperedge HE-1 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends"):
  with members:
    - "asymptotic performance analysis of a k hop amplify and forward relay mimo channel"
    - "iterative distributed minimum total mse approach for secure communications in mimo interference channels"
    - "asymptotic analysis of su mimo channels with transmitter noise and mismatched joint decoding"
    - "secure massive mimo transmission with an active eavesdropper"
    - "interference aligned space time transmission with diversity for the 2 times 2 x network"
    - "space time encoded miso broadcast channel with outdated csit an error rate and diversity performance analysis"
    - "high snr asymptotics of mutual information for discrete constellations with applications to bicm"
    - "differential distributed space time coding with imperfect synchronization in frequency selective channels"

Connected through hyperedge HE-2 (induced by source paper "omnidirectional space time block coding for common information broadcasting in massive mimo systems"):
  with members:
    - "free deterministic equivalents for the analysis of mimo multiple access channel"
    - "channel acquisition for massive mimo ofdm with adjustable phase shift pilots"
    - "secure massive mimo transmission with an active eavesdropper"
    - "physical layer security for massive mimo an overview on passive eavesdropping and active attacks"
    - "pilot reuse for massive mimo transmission over spatially correlated rayleigh fading channels"
    - "massive mimo multicasting in noncooperative cellular networks"
    - "pilot beam pattern design for channel estimation in massive mimo systems"
    - "massive mimo for next generation wireless systems"

Connected through hyperedge HE-3 (induced by source paper "reliable mimo optical wireless communications through super rectangular cover"):
  with members:
    - "full large scale diversity space codes for mimo optical wireless communications"
    - "high snr ber comparison of coherent and differentially coherent modulation schemes in lognormal fading channels"
    - "quasi orthogonal stbc with minimum decoding complexity"

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"
    - "on full diversity space time block codes with partial interference cancellation group decoding"

Connected through hyperedge HE-5 (induced by source paper "energy efficient full diversity collaborative unitary space time block code design via unique factorization of signals"):
  with members:
    - "four group decodable space time block codes"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "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-6 (induced by source paper "high rate and full diversity space time block codes with low complexity partial interference cancellation group decoding"):
  with members:
    - "a new full diversity criterion and low complexity stbcs with partial interference cancellation decoding"
    - "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"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-7 (induced by source paper "full diversity space time block codes with low complexity partial interference cancellation group decoding"):
  with members:
    - "asymptotic performance of linear receivers in mimo fading channels"
    - "diversity order in isi channels with single carrier frequency domain equalizers"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"

Connected through hyperedge HE-8 (induced by source paper "two designs of space time block codes achieving full diversity with partial interference cancellation group decoding"):
  with members:
    - "four group decodable space time block codes"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "on fast decodable space time block codes"
    - "quasi orthogonal stbc with minimum decoding complexity"

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)