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 "multiple bases belief propagation decoding of high density cyclic codes"):
  Abstract: We introduce a new method for decoding short and moderate-length linear block codes with dense parity check matrix representations of cyclic form. This approach is termed multiple-bases belief-propagation. The proposed iterative scheme makes use of the fact that a code has many structurally diverse parity-check matrices, capable of detecting different error patterns. We show that this inherent code property leads to decoding algorithms with significantly better performance when compared to standard belief-propagation decoding. Furthermore, we describe how to choose sets of parity-check matrices of cyclic form amenable for multiple-bases decoding, based on analytical studies performed for the binary erasure channel. For several cyclic and extended cyclic codes, the multiple-bases belief propagation decoding performance can be shown to closely follow that of the maximum-likelihood decoder.

Includes members:
  Member "permutation decoding and the stopping redundancy hierarchy of cyclic and extended cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stopping redundancy hierarchy beyond the minimum distance")
  Member "on parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bounds on separating redundancy of linear codes and rates of x codes")
  Member "on the hardness of approximating stopping and trapping sets in ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "design of finite length irregular protograph codes with low error floors over the binary input awgn channel using cyclic liftings")
  Member "complete enumeration of stopping sets of full rank parity check matrices of hamming codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fountain uncorrectable sets and finite length analysis")
  Member "on the stopping distance and the stopping redundancy of codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "decoder tailored polar code design using the genetic algorithm")
  Member "improved upper bounds on stopping redundancy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "bounds on separating redundancy of linear codes and rates of x codes")
  Member "pseudocodewords of tanner graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "free pseudodistance growth rates for spatially coupled ldpc codes over the bec")
  Member "iterative soft input soft output decoding of reed solomon codes by adapting the parity check matrix":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "pruning neural belief propagation decoders")

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)