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 "study of polarization driven shortening for polar codes designed with the gaussian approximation"):
  Abstract: This paper presents a polarization-driven (PD) shortening technique for the design of rate-compatible polar codes. The proposed shortening strategy consists of reducing the generator matrix by relating its row index with the channel polarization index. We assume that the shortened bits are known by both the encoder and the decoder and employ successive cancellation (SC) for decoding the shortened codes constructed by the proposed PD technique. A performance analysis is then carried out based on the Spectrum Distance (SD). Simulations show that the proposed PD-based shortened polar codes outperform existing shortened polar codes.

Includes members:
  Member "low complexity puncturing and shortening of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "iterative detection and decoding algorithms for mimo systems in block fading channels using ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "study of coarse quantization aware block diagonalization algorithms for mimo systems with low resolution")
  Member "rate compatible punctured polar codes optimal construction based on polar spectra":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a general construction and encoder implementation of polar codes")
  Member "capacity achieving rate compatible polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rate matching for polar codes based on binary domination")
  Member "a hybrid arq scheme based on polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "design of polar codes in 5g new radio")
  Member "on finite length performance of polar codes stopping sets error floor and concatenated design":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity approaching polar codes with long codewords and successive cancellation decoding based on improved gaussian approximation")
  Member "a practical approach to polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "rate matching for polar codes based on binary domination")

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)