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: "iterated space time code constructions from cyclic algebras"
  Abstract: We propose a full-rate iterated space-time code construction, to design 2n-dimensional codes from n-dimensional cyclic algebra based codes. We give a condition to determine whether the resulting codes satisfy the full-diversity property, and study their maximum likelihood decoding complexity with respect to sphere decoding. Particular emphasis is given to the cases n = 2, sometimes referred to as MIDO (multiple input double output) codes, and n = 3. In the process, we derive an interesting way of obtaining division algebras, and study their center and maximal subfield.

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"
    - "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"
    - "group decodable space time block codes with code rate 1"

Connected through hyperedge HE-3 (induced by source paper "fast decodable space time codes for the n relay and multiple access mimo channel"):
  with members:
    - "constructions of fast decodable distributed space time codes"
    - "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"
    - "algebraic codes and a new physical layer transmission protocol for wireless distributed storage systems"
    - "fast decodable asymmetric space time codes from division algebras"
    - "algebraic fast decodable relay codes for distributed communications"
    - "quadratic forms and space time block codes from generalized quaternion and biquaternion algebras"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "compute and forward harnessing interference through structured codes"

Connected through hyperedge HE-4 (induced by source paper "how to obtain lattices from f sigma delta codes via a generalization of construction a"):
  with members:
    - "on skew polynomial codes and lattices from quotients of cyclic division algebras"
    - "information bit error rate and false positives in an mds code"
    - "finite nonassociative algebras obtained from twisted polynomials over chain rings"
    - "a note on linear codes and nonassociative algebras obtained from skew polynomial rings"
    - "the nonassociative algebras used to build fast decodable space time block codes"
    - "on self dual mrd codes"
    - "a circulant approach to skew constacyclic codes"
    - "quotients of orders in cyclic algebras and space time codes"

Connected through hyperedge HE-5 (induced by source paper "bounds on fast decodability of space time block codes skew hermitian matrices and azumaya algebras"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "a family of fast decodable mido codes from crossed product algebras over q"
    - "minimizing the complexity of fast sphere decoding of stbcs"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "constructions of fast decodable distributed space time codes"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "algebraic fast decodable relay codes for distributed communications"
    - "on fast decodable space time block codes"
    - "optimal space time codes for the mimo amplify and forward cooperative channel"

Connected through hyperedge HE-7 (induced by source paper "the nonassociative algebras used to build fast decodable space time block codes"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "space time block codes from nonassociative division algebras"
    - "minimizing the complexity of fast sphere decoding of stbcs"

Connected through hyperedge HE-8 (induced by source paper "fast decodable mido codes with large coding gain"):
  with members:
    - "fast decodable asymmetric space time codes from division algebras"
    - "an enhanced dmt optimality criterion for stbc schemes for asymmetric mimo systems"
    - "improved perfect space time block codes"
    - "a family of fast decodable mido codes from crossed product algebras over q"
    - "space time block codes from nonassociative division algebras"
    - "maximal orders in the design of dense space time lattice codes"
    - "on fast decodable space time block codes"

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)