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 "quasi cross lattice tilings with applications to flash memory"):
  Abstract: We consider lattice tilings of $\R^n$ by a shape we call a $(\kp,\km,n)$-quasi-cross. Such lattices form perfect error-correcting codes which correct a single limited-magnitude error with prescribed maximal-magnitudes of positive error and negative error (the ratio of which is called the balance ratio). These codes can be used to correct both disturb and retention errors in flash memories, which are characterized by having limited magnitudes and different signs. #R##N#We construct infinite families of perfect codes for any rational balance ratio, and provide a specific construction for $(2,1,n)$-quasi-cross lattice tiling. The constructions are related to group splitting and modular $B_1$ sequences. We also study bounds on the parameters of lattice-tilings by quasi-crosses, connecting the arm lengths of the quasi-crosses and the dimension. We also prove constraints on group splitting, a specific case of which shows that the parameters of the lattice tiling of $(2,1,n)$-quasi-crosses is the only ones possible.

Includes members:
  Member "product constructions for perfect lee codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "50 years of the golomb welch conjecture")
  Member "constant weight gray codes for local rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "snake in the box codes for rank modulation")
  Member "codes in permutations and error correction for rank modulation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal constant weight codes under l_1 metric")
  Member "correcting limited magnitude errors in the rank modulation scheme":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "infinity norm permutation covering codes from cyclic groups")
  Member "on q ary codes correcting all unidirectional errors of a limited magnitude":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asymmetric single magnitude four error correcting codes")

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)