human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "construction of high rate regular quasi cyclic ldpc codes based on cyclic difference families"
  Abstract: For a high-rate case, it is difficult to randomly construct good low-density parity-check (LDPC) codes of short and moderate lengths because their Tanner graphs are prone to have short cycles. Also, the existing high-rate quasi-cyclic (QC) LDPC codes can be constructed only for very restricted code parameters. In this paper, based on special classes of cyclic difference families, we propose a new construction method of high-rate regular QC LDPC codes having parity-check matrices consisting of a single row of circulants with column-weight 3 or 4. The proposed QC LDPC codes can be constructed for various code rates and lengths including the minimum achievable length for given column-weight and design rate under girth 6. It is observed that the parity-check matrices of the proposed QC LDPC codes have full rank for column-weight 3 and just one redundant row for column-weight 4. It is shown that the error correcting performance of the proposed QC LDPC codes of short and moderate lengths is almost the same as that of the existing ones through numerical analysis.

Connected through hyperedge HE-1 (induced by source paper "design and analysis of time invariant sc ldpc convolutional codes with small constraint length"):
  with members:
    - "on advisability of designing short length qc ldpc codes using perfect difference families"
    - "spatially coupled ldpc codes constructed from protographs"
    - "quasi cyclic ldpc codes influence of proto and tanner graph structure on minimum hamming distance upper bounds"
    - "progressive differences convolutional low density parity check codes"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "deriving good ldpc convolutional codes from ldpc block codes"
    - "terminated ldpc convolutional codes with thresholds close to capacity"

Connected through hyperedge HE-2 (induced by source paper "design and analysis of time invariant sc ldpc codes with small constraint length"):
  with members:
    - "on advisability of designing short length qc ldpc codes using perfect difference families"
    - "spatially coupled ldpc codes constructed from protographs"
    - "hierarchical and high girth qc ldpc codes"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "searching for voltage graph based ldpc tailbiting codes with large girth"
    - "progressive differences convolutional low density parity check codes"
    - "windowed decoding of protograph based ldpc convolutional codes over erasure channels"
    - "deriving good ldpc convolutional codes from ldpc block codes"

Question: Please tell me which class the center node 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)