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: "perfect space time codes with minimum and non minimum delay for any number of antennas"
  Abstract: Perfect space-time codes were first introduced by Oggier et. al. to be the space-time codes that have full rate, full diversity-gain, non-vanishing determinant for increasing spectral efficiency, uniform average transmitted energy per antenna and good shaping of the constellation. These defining conditions jointly correspond to optimality with respect to the Zheng-Tse D-MG tradeoff, independent of channel statistics, as well as to near optimality in maximizing mutual information. All the above traits endow the code with error performance that is currently unmatched. Yet perfect space-time codes have been constructed only for 2,3,4 and 6 transmit antennas. We construct minimum and non-minimum delay perfect codes for all channel dimensions.

Connected through hyperedge HE-1 (induced by source paper "bit interleaved coded multiple beamforming with perfect coding"):
  with members:
    - "precoding by pairing subchannels to increase mimo capacity with discrete input alphabets"
    - "reduced complexity decoding for bit interleaved coded multiple beamforming with constellation precoding"
    - "golden coded multiple beamforming"
    - "constellation precoded beamforming"
    - "constellation precoded multiple beamforming"
    - "mimo precoding with x and y codes"
    - "reduced complexity sphere decoding"
    - "bit interleaved coded multiple beamforming with constellation precoding"

Connected through hyperedge HE-2 (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"
    - "fast maximum likelihood decoding of the golden code"
    - "reduced complexity sphere decoding for square qam via a new lattice representation"

Connected through hyperedge HE-3 (induced by source paper "space time block codes from nonassociative division algebras"):
  with members:
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"

Connected through hyperedge HE-4 (induced by source paper "golden coded multiple beamforming"):
  with members:
    - "constellation precoded beamforming"
    - "fast maximum likelihood decoding of the golden code"
    - "reduced complexity sphere decoding for square qam via a new lattice representation"

Connected through hyperedge HE-5 (induced by source paper "a new class of tast codes with a simplified tree structure"):
  with members:
    - "multigroup decodable stbcs from clifford algebras"

Connected through hyperedge HE-6 (induced by source paper "d mg tradeoff of df and af relaying protocols over asynchronous pam cooperative networks"):
  with members:
    - "ofdm based distributed space time coding for asynchronous relay networks"
    - "diversity multiplexing tradeoff of asynchronous cooperative diversity in wireless networks"
    - "d mg tradeoff and optimal codes for a class of af and df cooperative communication protocols"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-7 (induced by source paper "high snr analysis of outage limited communications with bursty and delay limited information"):
  with members:
    - "joint source and channel coding for mimo systems is it better to be robust or quick"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-8 (induced by source paper "space time codes from structured lattices"):
  with members:
    - "golden space time trellis coded modulation"
    - "approximately universal codes over slow fading channels"

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)