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 "source and channel polarization over finite fields and reed solomon matrices"):
  Abstract: Polarization phenomenon over any finite field $\mathbb{F}_{q}$ with size $q$ being a power of a prime is considered. This problem is a generalization of the original proposal of channel polarization by Arikan for the binary field, as well as its extension to a prime field by Sasoglu, Telatar, and Arikan. In this paper, a necessary and sufficient condition of a matrix over a finite field $\mathbb{F}_q$ is shown under which any source and channel are polarized. Furthermore, the result of the speed of polarization for the binary alphabet obtained by Arikan and Telatar is generalized to arbitrary finite field. It is also shown that the asymptotic error probability of polar codes is improved by using the Reed-Solomon matrix, which can be regarded as a natural generalization of the $2\times 2$ binary matrix used in the original proposal by Arikan.

Includes members:
  Member "rate dependent analysis of the asymptotic behavior of channel polarization":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polar codes simplicity random codes durability")
  Member "polar codes for the two user multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes simplicity random codes durability")
  Member "polar codes for q ary channels q 2 r":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "polar codes simplicity random codes durability")
  Member "multilevel polarization of polar codes over arbitrary discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes simplicity random codes durability")
  Member "channel polarization on q ary discrete memoryless channels by arbitrary kernels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "non binary polar codes using reed solomon codes and algebraic geometry codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "properties and construction of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes simplicity random codes durability")
  Member "polar codes for the m user mac":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "entropic matroids and their representation")

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)