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: "irregular product codes"
  Abstract: We consider irregular product codes.In this class of codes, each codeword is represented by a matrix. The entries in each row (column) of the matrix should come from a component row (column) code. As opposed to (standard) product codes, we do not require that all component row codes nor all component column codes be the same. As we will see, relaxing this requirement can provide some additional attractive features including 1) allowing some regions of the codeword be more error-resilient 2) allowing a more refined spectrum of rates for finite-lengths and improved performance in some of these rates 3) more interaction between row and column codes during decoding. We study these codes over erasure channels. We find that for any $0 < \epsilon < 1$, for many rate distributions on component row codes, there is a matching rate distribution on component column codes such that an irregular product code based on MDS codes with those rate distributions on the component codes has asymptotic rate $1 - \epsilon$ and can decode on erasure channels (of alphabet size equal the alphabet size of the component MDS codes) with erasure probability $< \epsilon$.

Connected through hyperedge HE-1 (induced by source paper "practical product code construction of polar codes"):
  with members:
    - "construction and decoding of product codes with non systematic polar codes"
    - "generalized fast decoding of polar codes"
    - "fast and flexible successive cancellation list decoders for polar codes"
    - "a comparative study of polar code constructions for the awgn channel"
    - "fast polar decoders algorithm and implementation"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "approaching miscorrection free performance of product and generalized product codes"):
  with members:
    - "a 9 52 db ncg fec scheme and 162 b cycle low complexity product decoder architecture"
    - "miscorrection free decoding of staircase codes"
    - "stall pattern avoidance in polynomial product codes"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "on the asymptotic performance of iterative decoders for product codes"

Connected through hyperedge HE-3 (induced by source paper "edge coloring and stopping sets analysis in product codes with mds components"):
  with members:
    - "a bound on rate of codes with locality with sequential recovery from multiple erasures"
    - "reed muller codes achieve capacity on erasure channels"
    - "reed muller codes achieve capacity on the binary erasure channel under map decoding"
    - "codes with locality for two erasures"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"
    - "on the locality of codeword symbols"
    - "low density parity check codes for nonergodic block fading channels"

Connected through hyperedge HE-4 (induced by source paper "density evolution for deterministic generalized product codes on the binary erasure channel at high rates"):
  with members:
    - "density evolution for deterministic generalized product codes with higher order modulation"
    - "deterministic and ensemble based spatially coupled product codes"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "on the asymptotic performance of iterative decoders for product codes"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-5 (induced by source paper "density evolution for deterministic generalized product codes on the binary erasure channel"):
  with members:
    - "density evolution for deterministic generalized product codes with higher order modulation"
    - "a simple proof of maxwell saturation for coupled scalar recursions"
    - "staircase codes fec for 100 gb s otn"
    - "approaching capacity at high rates with iterative hard decision decoding"
    - "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec"
    - "on the asymptotic performance of iterative decoders for product codes"
    - "finite length scaling for iteratively decoded ldpc ensembles"

Connected through hyperedge HE-6 (induced by source paper "product construction of affine codes"):
  with members:
    - "coded modulation for power line communications"

Connected through hyperedge HE-7 (induced by source paper "inter frame coding for broadcast communication"):
  with members:
    - "interleaved product ldpc 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)