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: "performance limits and practical decoding of interleaved reed solomon polar concatenated codes"
  Abstract: A scheme for concatenating the recently invented polar codes with non-binary MDS codes, as Reed-Solomon codes, is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. We show that for any e > 0, and total frame length N, the parameters of the scheme can be set such that the frame error probability is less than 2^{-N^{1-e}}, while the scheme is still capacity achieving. This improves upon 2^{-N^{0.5-e}}, the frame error probability of Arikan's polar codes. The proposed concatenated polar codes and Arikan's polar codes are also compared for transmission over channels with erasure bursts. We provide a sufficient condition on the length of erasure burst which guarantees failure of the polar decoder. On the other hand, it is shown that the parameters of the concatenated polar code can be set in such a way that the capacity-achieving properties of polar codes are preserved. We also propose decoding algorithms for concatenated polar codes, which significantly improve the error-rate performance at finite block lengths while preserving the low decoding complexity.

Connected through hyperedge HE-1 (induced by source paper "threshold secure coding with shared key"):
  with members:
    - "distributed multi user secret sharing"
    - "rate compatible polar codes for wireless channels"
    - "on finite length performance of polar codes stopping sets error floor and concatenated design"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "the secrecy capacity of the mimo wiretap channel"
    - "the gaussian multiple access wire tap channel"
    - "applications of ldpc codes to the wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "interleaved polar i polar codes"):
  with members:
    - "coding in the finite blocklength regime bounds based on laplace integrals and their asymptotic approximations"
    - "does gaussian approximation work well for the long length polar code construction"
    - "llr based successive cancellation list decoding of polar codes"
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "performance of polar codes for channel and source coding"

Connected through hyperedge HE-3 (induced by source paper "polar like codes and asymptotic tradeoff among block length code rate and error probability"):
  with members:
    - "performance bounds of concatenated polar coding schemes"
    - "scaling exponent and moderate deviations asymptotics of polar codes for the awgn channel"
    - "relaxed polar codes"
    - "minimum distance based construction of multi kernel polar codes"
    - "multi kernel polar codes proof of polarization and error exponents"
    - "a note on some inequalities used in channel polarization and polar coding"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "multi kernel construction of polar codes"

Connected through hyperedge HE-4 (induced by source paper "deep learning methods for improved decoding of linear codes"):
  with members:
    - "an introduction to deep learning for the physical layer"
    - "performance bounds of concatenated polar coding schemes"
    - "scaling deep learning based decoding of polar codes via partitioning"
    - "rnn decoding of linear block codes"
    - "detection algorithms for communication systems using deep learning"
    - "neural offset min sum decoding"
    - "on deep learning based channel decoding"
    - "learning to decode linear codes using deep learning"

Connected through hyperedge HE-5 (induced by source paper "circular buffer rate matched polar codes"):
  with members:
    - "recursive constructions and their maximum likelihood decoding"
    - "relaxed polar codes"
    - "binary polar codes are optimised codes for bitwise multistage decoding"
    - "multi kernel construction of polar codes"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "rate compatible polar codes for wireless channels"
    - "capacity achieving rateless polar codes"
    - "from polar to reed muller codes a technique to improve the finite length performance"

Connected through hyperedge HE-6 (induced by source paper "a novel high rate polar staircase coding scheme"):
  with members:
    - "information rates of next generation long haul optical fiber systems using coded modulation"
    - "flexible and low complexity encoding and decoding of systematic polar codes"
    - "list decoding of polar codes"
    - "staircase codes fec for 100 gb s otn"

Connected through hyperedge HE-7 (induced by source paper "cluster pairwise error probability and construction of parity check concatenated polar codes"):
  with members:
    - "list decoding of polar codes"
    - "an adaptive successive cancellation list decoder for polar codes with cyclic redundancy check"
    - "how to construct polar codes"

Connected through hyperedge HE-8 (induced by source paper "binary linear codes with optimal scaling polar codes with large kernels"):
  with members:
    - "achieving the uniform rate region of general multiple access channels by polar coding"
    - "near optimal finite length scaling for polar codes over large alphabets"
    - "construction of polar codes with sublinear complexity"
    - "finite length scaling for polar codes"
    - "polar codes speed of polarization and polynomial gap to capacity"
    - "scaling exponent of list decoders with applications to polar codes"
    - "rate dependent analysis of the asymptotic behavior of channel polarization"
    - "spatially coupled ensembles universally achieve capacity under belief propagation"

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)