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 "spectral analysis of quasi cyclic product codes"):
  Abstract: This paper considers a linear quasi-cyclic product code of two given quasi-cyclic codes of relatively prime lengths over finite fields. We give the spectral analysis of a quasi-cyclic product code in terms of the spectral analysis of the row- and the column-code. Moreover, we provide a new lower bound on the minimum Hamming distance of a given quasi-cyclic code and present a new algebraic decoding algorithm.More specifically, we prove an explicit (unreduced) basis of an l\_a l\_b-quasi-cyclic product code in terms of the generator matrix in reduced Gr{\"o}bner basis with respect to the position-over-term order (RGB/POT) form of the l\_a-quasi-cyclic row- and the l\_b-quasi-cyclic column-code, respectively. This generalizes the work of Burton and Weldon for the generator polynomial of a cyclic product code (where l\_a =l\_b=1). Furthermore, we derive the generator matrix in Pre-RGB/POT form of an l\_a l\_b-quasi-cyclic product code for two special cases: (i) for l\_a=2 and l\_b=1, and (ii) if the row-code is a 1-level l\_a-quasi-cyclic code (for arbitrary l\_a) and l\_b=1.For arbitrary l\_a and l\_b, the Pre-RGB/POT form of the generator matrix of an l\_a l\_b-quasi-cyclic product code is conjectured.The spectral analysis is applied to the generator matrix of the product of an l-quasi-cyclic and a cyclic code, and we propose a new lower bound on the minimum Hamming distance of a given l-quasi-cyclic code. In addition, we develop an efficient syndrome-based decoding algorithm for l-phased burst errors with guaranteed decoding radius.

Includes members:
  Member "construction of quasi cyclic product codes":
    also connected through other hyperedges:
      (none)
  Member "decoding of quasi cyclic codes up to a new lower bound on the minimum distance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a quantum secure niederreiter cryptosystem using quasi cyclic codes")
  Member "generalizing bounds on the minimum distance of cyclic codes using cyclic product codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decoding of repeated root cyclic codes up to new bounds on their minimum distance")
  Member "bounds on the minimum distance of punctured quasi cyclic ldpc codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "characterization and efficient search of non elementary trapping sets of ldpc codes with applications to stopping sets")
  Member "on the decoding of quasi bch codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decoding of quasi cyclic codes up to a new lower bound on the minimum distance")
  Member "a new bound on the minimum distance of cyclic codes using small minimum distance cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal linear and cyclic locally repairable codes over small fields")
  Member "on quasi cyclic codes as a generalization of cyclic codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "construction of quasi cyclic product codes")
  Member "collaborative decoding of interleaved reed solomon codes and concatenated code designs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "enhancing simultaneous rational function recovery adaptive error correction capability and new bounds for applications")

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)