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 "high snr asymptotics of mutual information for discrete constellations with applications to bicm"):
  Abstract: Asymptotic expressions of the mutual information between any discrete input and the corresponding output of the scalar additive white Gaussian noise channel are presented in the limit as the signal-to-noise ratio (SNR) tends to infinity. Asymptotic expressions of the symbol-error probability (SEP) and the minimum mean-square error (MMSE) achieved by estimating the channel input given the channel output are also developed. It is shown that for any input distribution, the conditional entropy of the channel input given the output, MMSE, and SEP have an asymptotic behavior proportional to the Gaussian Q-function. The argument of the Q-function depends only on the minimum Euclidean distance (MED) of the constellation and the SNR, and the proportionality constants are functions of the MED and the probabilities of the pairs of constellation points at MED. The developed expressions are then generalized to study the high-SNR behavior of the generalized mutual information (GMI) for bit-interleaved coded modulation (BICM). By means of these asymptotic expressions, the long-standing conjecture that Gray codes are the binary labelings that maximize the BICM-GMI at high SNR is proven. It is further shown that for any equally spaced constellation whose size is a power of two, there always exists an anti-Gray code giving the lowest BICM-GMI at high SNR.

Includes members:
  Member "signal shaping for bicm at low snr":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "broadcast coded modulation multilevel and bit interleaved construction")
  Member "on the exact ber of bit wise demodulators for one dimensional constellations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "asymptotic comparison of ml and map detectors for multidimensional constellations")
  Member "general ber expression for one dimensional constellations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the impact of optimal modulation and fec overhead on future optical networks")
  Member "multiple antenna fading coherent channels with arbitrary inputs characterization and optimization of the reliable information transmission rate":
    also connected through other hyperedges:
      (none)
  Member "precoding for outage probability minimization on block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "space time signal design for multilevel polar coding in slow fading broadcast channels")
  Member "optimal alphabets and binary labelings for bicm at low snr":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multidimensional constellations for uplink scma systems a comparative study")
  Member "mutual information and minimum mean square error in gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")

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)