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 "faulty successive cancellation decoding of polar codes for the binary erasure channel"):
  Abstract: In this paper, the faulty successive cancellation decoding of polar codes for the binary erasure channel is studied. To this end, a simple erasure-based fault model is introduced to represent errors in the decoder, and it is shown that, under this model, polarization does not happen, meaning that fully reliable communication is not possible at any rate. Furthermore, a lower bound on the frame error rate of polar codes under faulty successive cancellation decoding is provided, which is then used, along with a well-known upper bound, in order to choose a blocklength that minimizes the erasure probability under faulty decoding. Finally, an unequal error protection scheme that can re-enable asymptotically erasure-free transmission at a small rate loss and by protecting only a constant fraction of the decoder is proposed. The same scheme is also shown to significantly improve the finite-length performance of the faulty successive cancellation decoder by protecting as little as 1.5% of the decoder.

Includes members:
  Member "analysis and design of finite alphabet iterative decoders robust to faulty hardware":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "performance of ldpc decoders with missing connections")
  Member "density evolution and functional threshold for the noisy min sum decoder":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "performance of ldpc decoders with missing connections")
  Member "density evolution for min sum decoding of ldpc codes under unreliable message storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "performance analysis based on density evolution on fault erasure belief propagation decoder")
  Member "on the correlation between polarized becs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar code moderate deviation recovering the scaling exponent")
  Member "polar codes robustness of the successive cancellation decoder with respect to quantization":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite level quantization procedures for construction and decoding of polar codes")
  Member "hardware architectures for successive cancellation decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "reed muller codes theory and algorithms")
  Member "performance of ldpc codes under faulty iterative decoding":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "exploiting errors for efficiency a survey from circuits to algorithms")

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)