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 "mutual information maximizing quantized belief propagation decoding of ldpc codes"):
  Abstract: A severe problem for mutual information-maximizing lookup table (MIM-LUT) decoding of low-density parity-check (LDPC) code is the high memory cost for using large tables, while decomposing large tables to small tables deteriorates decoding error performance. In this paper, we propose a method, called mutual information-maximizing quantized belief propagation (MIM-QBP) decoding, to remove the lookup tables used for MIM-LUT decoding. Our method leads to a very practical decoder, namely the MIM-QBP decoder, which can be implemented based only on simple mappings and fixed-point additions. We further present how to practically and systematically design the MIM-QBP decoder for both regular and irregular LDPC codes. Simulation results show that the MIM-QBP decoder can always considerably outperform the state-of-the-art MIM-LUT decoder. Furthermore, the MIM-QBP decoder with only 3 bits per message can outperform the floating-point belief propagation (BP) decoder at high signal-to-noise ratio (SNR) regions when testing on high-rate codes with a maximum of 10-30 iterations.

Includes members:
  Member "dynamic programming for discrete memoryless channel quantization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "entropy constrained maximizing mutual information quantization")
  Member "quantized message passing for ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decoding of non binary ldpc codes using the information bottleneck method")
  Member "finite alphabet iterative decoders part ii towards guaranteed error correction of ldpc codes via iterative decoder diversity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a fully unrolled ldpc decoder based on quantized message passing")
  Member "quantization of binary input discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "intelligence physics and information the tradeoff between accuracy and simplicity in machine learning")

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)