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 and decoding of product codes with non systematic polar codes"
  Abstract: Product codes are widespread in optical communications, thanks to their high throughput and good error-correction performance. Systematic polar codes have been recently considered as component codes for product codes. In this paper, we present a novel construction for product polar codes based on non-systematic polar codes. We prove that the resulting product code is actually a polar code, having a frozen set that is dependent on the frozen sets of the component polar codes. We propose a low-complexity decoding algorithm exploiting the dual nature of the constructed code. Performance analysis and simulations show high decoding speed, that allows to construct long codes while maintaining low decoding latency. The resulting high throughput and good error-correction performance are appealing for optical communication systems and other systems where high throughput and low latency are required.

Connected through hyperedge HE-1 (induced by source paper "scan list decoding of polar codes"):
  with members:
    - "permutation decoding of polar codes"
    - "on the decoding of polar codes on permuted factor graphs"
    - "belief propagation decoding of polar codes on permuted factor graphs"
    - "belief propagation list decoding of polar codes"
    - "a comparative study of polar code constructions for the awgn channel"
    - "list decoding of polar codes"

Connected through hyperedge HE-2 (induced by source paper "on the construction of g_n coset codes for parallel decoding"):
  with members:
    - "permutation decoding of polar codes"
    - "a new permutation decoding method for reed muller codes"
    - "a 5 16gbps decoder asic for polar code in 16nm finfet"
    - "a flip syndrome list polar decoder architecture for ultra low latency communications"
    - "strange attractor for efficient polar code design"
    - "reed muller codes achieve capacity on erasure channels"
    - "improved successive cancellation decoding of polar codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-3 (induced by source paper "practical product code construction of polar codes"):
  with members:
    - "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"
    - "irregular product codes"
    - "list decoding of polar codes"

Connected through hyperedge HE-4 (induced by source paper "successive cancellation list decoding of product codes with reed muller component codes"):
  with members:
    - "low complexity joint channel estimation and list decoding of short codes"
    - "efficient error correcting codes in the short blocklength regime"
    - "soft decision decoding of reed muller codes recursive lists"
    - "recursive decoding and its performance for low rate reed muller codes"
    - "successive cancellation decoding of single parity check product codes"
    - "list decoding of polar 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)