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 "a correlation breaking interleaving of polar codes in concatenated systems"):
  Abstract: It is known that the bit errors of polar codes with successive cancellation (SC) decoding are coupled. However, existing concatenation schemes of polar codes with other error correction codes rarely take this coupling effect into consideration. To achieve a better error performance of concatenated systems with polar codes as inner codes, one can divide all bits in an outer block into different polar blocks to completely de-correlate the possible coupled errors in the transmitter side. We call this interleaving a blind interleaving (BI) which serves as a benchmark. Two BI schemes, termed BI-DP and BI-CDP, are proposed in the paper. To better balance performance, memory size, and the decoding delay from the de-interleaving, a novel interleaving scheme, named the correlation-breaking interleaving (CBI), is proposed. The CBI breaks the correlated information bits based on the error correlation pattern proposed and proven in this paper. The proposed CBI scheme is general in the sense that any error correction code can serve as the outer code. In this paper, Low-Density Parity-Check (LDPC) codes and BCH codes are used as two examples of the outer codes of the interleaving scheme. The CBI scheme 1) can keep the simple SC polar decoding while achieving a better error performance than the state-of-the-art (SOA) direct concatenation of polar codes with LDPC codes and BCH codes; 2) achieves a comparable error performance as the BI-DP scheme with a smaller memory size and a shorter decoding delay. Numerical results are provided to verify the performance of the BI schemes and the CBI scheme.

Includes members:
  Member "a novel interleaving scheme for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a correlation breaking interleaving of polar codes")
  Member "on the error performance of systematic polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a correlation breaking interleaving of polar codes")
  Member "fast polar decoders algorithm and implementation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "finite length scaling for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reed muller codes theory and algorithms")
  Member "improved successive cancellation decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "rate dependent analysis of the asymptotic behavior of channel polarization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes simplicity random codes durability")
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "how to construct polar codes":
    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)