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 "successive cancellation list decoding of product codes with reed muller component codes"):
  Abstract: This letter proposes successive cancellation list (SCL) decoding of product codes with Reed--Muller (RM) component codes. SCL decoding relies on a product code description based on the $2\times 2$ Hadamard kernel, which enables interpreting the code as an RM subcode. The focus is on a class of product codes considered in wireless communication systems, based on single parity-check and extended Hamming component codes. For short product codes, it is shown that SCL decoding with a moderate list size performs as well as (and, sometimes, outperforms) belief propagation (BP) decoding. Furthermore, by concatenating a short product code with a high-rate outer code, SCL decoding outperforms BP decoding by up to $1.4$ dB.

Includes members:
  Member "construction and decoding of product codes with non systematic polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scan list decoding of polar codes")
  Member "low complexity joint channel estimation and list decoding of short codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "saddlepoint approximations for rayleigh block fading channels")
  Member "efficient error correcting codes in the short blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an efficient algorithm for designing optimal crcs for tail biting convolutional codes")
  Member "soft decision decoding of reed muller codes recursive lists":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "recursive decoding and its performance for low rate reed muller codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reed muller codes theory and algorithms")
  Member "successive cancellation decoding of single parity check product codes":
    also connected through other hyperedges:
      (none)
  Member "list decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)