human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "almost universal codes achieving ergodic mimo capacity within a constant gap"):
  Abstract: This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criterion based on the normalized minimum determinant is proposed for division algebra multiblock space-time codes over fading channels; this plays a similar role to the Hermite invariant for Gaussian channels. It is shown that this criterion is sufficient to guarantee transmission rates within a constant gap from capacity both for slow fading channels and ergodic fading channels. This performance is achieved both under maximum likelihood decoding and naive lattice decoding. In the case of independent identically distributed Rayleigh fading, it is also shown that the error probability vanishes exponentially fast. In contrast to the standard approach in the literature which employs random lattice ensembles, the existence results in this paper are derived from number theory. First the gap to capacity is shown to depend on the discriminant of the chosen division algebra; then class field theory is applied to build families of algebras with small discriminants. The key element in the construction is the choice of a sequence of division algebras whose centers are number fields with small root discriminants.

Includes members:
  Member "polar codes and polar lattices for independent fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "markov chain monte carlo methods for lattice gaussian sampling convergence analysis and enhancement")
  Member "algebraic lattice codes achieve the capacity of the compound block fading channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "ring compute and forward over block fading channels")
  Member "almost universal codes for fading wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "well rounded lattices towards optimal coset codes for gaussian and fading wiretap channels")
  Member "division algebra codes achieve mimo block fading channel capacity within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algebraic lattice codes for linear fading channels")
  Member "number field lattices achieve gaussian and rayleigh channel capacity within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and polar lattices for independent fading channels")
  Member "precoded integer forcing universally achieves the mimo capacity to within a constant gap":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "inverse determinant sums and connections between fading channel information theory and algebra":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "the dmt classification of real and quaternionic lattice codes")
  Member "dispersion analysis of infinite constellations in ergodic fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on the separability of ergodic fading mimo channels a lattice coding approach")

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