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 "time invariant spatially coupled low density parity check codes with small constraint length"):
  Abstract: We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping procedures. We show that, by directly designing the LDPCC code syndrome former matrix without the constraints of the underlying QC block code, it is possible to achieve smaller constraint lengths with respect to the best solutions available in the literature. We also find theoretical lower bounds on the syndrome former constraint length for codes with a specified minimum length of the local cycles in their Tanner graphs. For this purpose, we exploit a new approach based on a numerical representation of the syndrome former matrix, which generalizes over a technique we already used to study a special subclass of the codes here considered.

Includes members:
  Member "array convolutional low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the minimum distance of array based spatially coupled low density parity check codes")
  Member "spatially coupled ensembles universally achieve capacity under belief propagation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi dimensional spatially coupled code design enhancing the cycle properties")
  Member "searching for voltage graph based ldpc tailbiting codes with large girth":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "integer ring sieve irs for constructing compact qc ldpc codes with large girth")
  Member "progressive differences convolutional low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "design and analysis of time invariant sc ldpc convolutional codes with small constraint length")
  Member "deriving good ldpc convolutional codes from ldpc block codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "analysis and optimization of tail biting spatially coupled protograph ldpc codes for bicm id systems")

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)