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: "fast maximum likelihood decoding of the golden code"
  Abstract: The golden code is a full-rate full-diversity space-time code for two transmit antennas that has a maximal coding gain. Because each codeword conveys four information symbols from an M-ary quadrature-amplitude modulation alphabet, the complexity of an exhaustive search decoder is proportional to M^2. In this paper we present a new fast algorithm for maximum-likelihood decoding of the golden code that has a worst-case complexity of only O(2M^2.5). We also present an efficient implementation of the fast decoder that exhibits a low average complexity. Finally, in contrast to the overlaid Alamouti codes, which lose their fast decodability property on time-varying channels, we show that the golden code is fast decodable on both quasistatic and rapid time-varying channels.

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 "revisited design criteria for stbcs with reduced complexity ml decoding"):
  with members:
    - "achieving low complexity maximum likelihood detection for the 3d mimo code"
    - "construction of block orthogonal stbcs and reducing their sphere decoding complexity"
    - "fast decodable asymmetric space time codes from division algebras"
    - "iterated space time code constructions from cyclic algebras"
    - "a family of fast decodable mido codes from crossed product algebras over q"
    - "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"
    - "optimization of fast decodable full rate stbc with non vanishing determinants"
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"

Connected through hyperedge HE-3 (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"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "3d mimo scheme for broadcasting future digital tv in single frequency networks"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-4 (induced by source paper "reduced complexity maximum likelihood decoding for 3d mimo code"):
  with members:
    - "3d mimo scheme for broadcasting future digital tv in single frequency networks"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-5 (induced by source paper "construction of block orthogonal stbcs and reducing their sphere decoding complexity"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "block orthogonal space time code structure and its impact on qrdm decoding complexity reduction"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "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"
    - "high rate multi symbol decodable stbcs from clifford algebras"
    - "multigroup decodable stbcs from clifford algebras"

Connected through hyperedge HE-6 (induced by source paper "multiple beamforming with perfect coding"):
  with members:
    - "reduced complexity decoding for bit interleaved coded multiple beamforming with constellation precoding"
    - "constellation precoded beamforming"
    - "constellation precoded multiple beamforming"
    - "reduced complexity sphere decoding"
    - "bit interleaved coded multiple beamforming with constellation precoding"
    - "diversity analysis of bit interleaved coded multiple beamforming"
    - "reduced complexity sphere decoding for square qam via a new lattice representation"
    - "perfect space time codes with minimum and non minimum delay for any number of antennas"

Connected through hyperedge HE-7 (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"
    - "on full diversity space time block codes with partial interference cancellation group decoding"
    - "on fast decodable space time block codes"

Connected through hyperedge HE-8 (induced by source paper "generalized distributive law for ml decoding of space time block codes"):
  with members:
    - "a family of fast decodable mido codes from crossed product algebras over q"
    - "four group decodable space time block codes"
    - "on the search for high rate quasi orthogonal space time block code"
    - "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)