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 "on the analysis of puncturing for finite length polar codes boolean function approach"):
  Abstract: This paper investigates the impact of puncturing on finite-length polar codes in which a puncturing pattern $\pv^{N}=(p_0,...,p_N)$ is applied to a length-$N$ polar code.. We first introduce two virtual channels to stochastically model the punctured (untransmitted) bits, which are respectively called {\em useless channel model} (UCM) and {\em deterministic channel model} (DCM). Under each model, we derive boolean functions in variables $p_0,...,p_{N-1}$ that can indicate which polarized channels should carry frozen bits. Based on this, we present an efficient method to jointly optimize a puncturing pattern and an information set. Focusing on a fixed information set, we show that there exist the so-called {\em catastrophic} puncturing patterns that will surely lead to a block error and derive their weight distributions recursively. We then propose the two construction methods of a rate-compatible (RC) polar code which ensures that each puncturing pattern in the family is non-catastrophic. Simulation results demonstrate that the proposed RC polar code outperform the RC Turbo code adopted in LTE.

Includes members:
  Member "a hybrid arq scheme based on polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "design of polar codes in 5g new radio")
  Member "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 "a practical approach to polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "rate matching for polar codes based on binary domination")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reed muller codes theory and 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)