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 "a theoretical analysis of the error correction capability of ldpc and mdpc codes under parallel bit flipping decoding"):
  Abstract: Iterative decoders used for decoding low-density parity-check (LDPC) and moderate-density parity-check (MDPC) codes are not characterized by a deterministic decoding radius and their error rate performance is usually assessed through intensive Monte Carlo simulations. However, several applications like code-based cryptography need guaranteed low values of the error rate, which are infeasible to assess through simulations, thus requiring the development of theoretical models for the error rate of these codes under iterative decoding. Some models of this type already exist, but become computationally intractable for parameters of practical interest. Other approaches attempt at approximating the code ensemble behaviour through assumptions, which however are hardly verified by a specific code and can barely be tested for very low error rate values. In this paper we propose a theoretical analysis of the error correction capability of LDPC and MDPC codes under a single-iteration parallel bit-flipping decoder that does not require any assumption. This allows us to derive a theoretical bound on the error rate of such a decoding algorithm, which hence results in a guaranteed error correction capability for any single code. We show an example of application of the new bound to the context of code-based cryptography, where guaranteed error rates are needed to achieve some strong security notions.

Includes members:
  Member "analysis of reaction and timing attacks against cryptosystems based on sparse parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of the error correction capability of ldpc and mdpc codes under parallel bit flipping decoding and application to cryptography")
  Member "on the guaranteed error correction capability of ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis of the error correction capability of ldpc and mdpc codes under parallel bit flipping decoding and application to cryptography")

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)