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 construction of g_n coset codes for parallel decoding"):
  Abstract: In this paper, we propose a type of $G_N$-coset codes for a highly parallel stage-permuted turbo-like decoder. The decoder exploits the equivalence between two stage-permuted factor graphs of $G_N$-coset codes. Specifically, the inner codes of a $G_N$-coset code consist of independent component codes, thus are decoded in parallel. The extrinsic information of the code bits is obtained and iteratively exchanged between the two graphs until convergence. Accordingly, we explore a heuristic and flexible code construction method (information set selection) for various information lengths and coding rates. Simulations show that the proposed $G_N$-coset codes could achieve a coding performance comparable with polar codes but enjoy higher decoding parallelism.

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 "permutation decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "partially symmetric monomial codes")
  Member "a new permutation decoding method for reed muller codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "perm2vec graph permutation selection for decoding of error correction codes using self attention")
  Member "a 5 16gbps decoder asic for polar code in 16nm finfet":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an asymmetric adaptive scl decoder hardware for ultra low error rate polar codes")
  Member "a flip syndrome list polar decoder architecture for ultra low latency communications":
    also connected through other hyperedges:
      (none)
  Member "strange attractor for efficient polar code design":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "construction of polar codes with sublinear complexity")
  Member "reed muller codes achieve capacity on erasure channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "partially symmetric monomial codes")
  Member "improved successive cancellation decoding of polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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)