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 "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"):
  Abstract: Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph structure parameters (like variable degrees, check node degrees, girth) of the Tanner graph and of the underlying proto-graph. Moreover, for several classes of proto-graphs we present explicit QC LDPC code constructions that achieve (or come close to) the respective minimum Hamming distance upper bounds. Because of the tight algebraic connection between QC codes and convolutional codes, we can state similar results for the free Hamming distance of convolutional codes. In fact, some QC code statements are established by first proving the corresponding convolutional code statements and then using a result by Tanner that says that the minimum Hamming distance of a QC code is upper bounded by the free Hamming distance of the convolutional code that is obtained by “unwrapping” the QC code.

Includes members:
  Member "searching for voltage graph based ldpc tailbiting codes with large girth":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  Member "deriving good ldpc convolutional codes from ldpc block codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis and optimization of tail biting spatially coupled protograph ldpc codes for bicm id systems")
  Member "lowering the error floor of ldpc codes using cyclic liftings":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  Member "on distance properties of quasi cyclic protograph based ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "windowed decoding of protograph based ldpc convolutional codes over erasure channels")
  Member "absdet pseudo codewords and perm pseudo codewords definitions and properties":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bounding the bethe and the degree m bethe permanents")
  Member "adaptive methods for linear programming decoding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient qp admm decoder for binary ldpc codes and its performance analysis")
  Member "pseudo codeword analysis of tanner graphs from projective and euclidean planes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "pseudocodeword free criterion for codes with cycle free tanner graph")
  Member "a new construction for ldpc codes using permutation polynomials over integer rings":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "permutation polynomial interleavers an algebraic geometric perspective")

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)