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 "ldpc codes from latin squares free of small trapping sets"):
  Abstract: This paper is concerned with the construction of low-density parity-check (LDPC) codes with low error floors. Two main contributions are made. First, a new class of structured LDPC codes is introduced. The parity check matrices of these codes are arrays of permutation matrices which are obtained from Latin squares and form a finite field under some matrix operations. Second, a method to construct LDPC codes with low error floors on the binary symmetric channel (BSC) is presented. Codes are constructed so that their Tanner graphs are free of certain small trapping sets. These trapping sets are selected from the Trapping Set Ontology for the Gallager A/B decoder. They are selected based on their relative harmfulness for a given decoding algorithm. We evaluate the relative harmfulness of different trapping sets for the sum product algorithm (SPA) by using the topological relations among them and by analyzing the decoding failures on one trapping set in the presence or absence of other trapping sets.

Includes members:
  Member "on trapping sets and guaranteed error correction capability of ldpc codes and gldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "check hybrid gldpc codes systematic elimination of trapping sets and guaranteed error correction capability")
  Member "a message passing algorithm for counting short cycles in a graph":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate compatible ldpc codes based on puncturing and extension techniques for short block lengths")
  Member "instanton based techniques for analysis and reduction of error floors of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the admm penalized decoder for ldpc codes")
  Member "ldpc codes which can correct three errors under iterative decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite alphabet iterative decoders part ii towards guaranteed error correction of ldpc codes via iterative decoder diversity")
  Member "shortened array codes of large girth":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from cages to trapping sets and codewords a technique to derive tight upper bounds on the minimum size of trapping sets and minimum distance of ldpc codes")
  Member "pseudocodewords of tanner graphs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "free pseudodistance growth rates for spatially coupled ldpc codes over the bec")

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)