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 "optimizing polar codes compatible with off the shelf ldpc decoders"):
  Abstract: Previous work showed that polar codes can be decoded using off-the-shelf LDPC decoders by imposing special constraints on the LDPC code structure, which, however, resulted in some performance degradation. In this paper we show that this loss can be mitigated; in particular, we demonstrate how the gap between LDPC-style decoding and Arikan's Belief Propagation (BP) decoding of polar codes can be closed by taking into account the underlying graph structure of the LDPC decoder while jointly designing the polar code and the parity-check matrix of the corresponding LDPC-like code. The resulting polar codes under conventional LDPC-style decoding are shown to have similar error-rate performance when compared to some well-known and standardized LDPC codes. Moreover, we obtain performance gains in the high SNR region.

Includes members:
  Member "design of polar codes in 5g new radio":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "belief propagation list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "sparse graphs for belief propagation decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "deep learning based polar code design")
  Member "code design for short blocks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decoder tailored polar code design using the genetic algorithm")
  Member "fast list decoders for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "flexible length polar codes through graph based augmentation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "crc aided belief propagation list decoding of polar codes")
  Member "a rm polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polarization adjusted convolutional pac codes fano decoding vs list decoding")
  Member "from polar to reed muller codes a technique to improve the finite length performance":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar codes and their quantum domain counterparts")

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)