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: "practical encoders and decoders for euclidean codes from barnes wall lattices"
  Abstract: In this paper, we address the design of high spectral-efficiency Barnes-Wall (BW) lattice codes which are amenable to low-complexity decoding in additive white Gaussian noise (AWGN) channels. We propose a new method of constructing complex BW lattice codes from linear codes over polynomial rings, and show that the proposed construction provides an explicit method of bit-labeling complex BW lattice codes. To decode the code, we adapt the low-complexity sequential BW lattice decoder (SBWD) recently proposed by Micciancio and Nicolosi. First, we study the error performance of SBWD in decoding the infinite lattice, wherein we analyze the noise statistics in the algorithm, and propose a new upper bound on its error performance. We show that the SBWD is powerful in making correct decisions well beyond the packing radius. Subsequently, we use the SBWD to decode lattice codes through a novel noise-trimming technique. This is the first work that showcases the error performance of SBWD in decoding BW lattice codes of large block lengths.

Connected through hyperedge HE-1 (induced by source paper "on the decoding of barnes wall lattices"):
  with members:
    - "multilevel constructions coding packing and geometric uniformity"
    - "soft decision decoding of reed muller codes recursive lists"
    - "finite dimensional infinite constellations"
    - "turbo lattices construction and error decoding performance"
    - "list decoding barnes wall lattices"
    - "low density lattice codes"

Connected through hyperedge HE-2 (induced by source paper "construction a of lattices over number fields and block fading wiretap coding"):
  with members:
    - "an error probability approach to mimo wiretap channels"
    - "lattice code design for the rayleigh fading wiretap channel"
    - "low density lattice codes"

Connected through hyperedge HE-3 (induced by source paper "connections between construction d and related constructions of lattices"):
  with members:
    - "turbo lattices construction and error decoding performance"
    - "lattice codes for the gaussian wiretap channel"

Connected through hyperedge HE-4 (induced by source paper "integer forcing mimo linear receivers based on lattice reduction"):
  with members:
    - "an algebraic approach to physical layer network coding"
    - "on complex lll algorithm for integer forcing linear receivers"
    - "on the proximity factors of lattice reduction aided decoding"
    - "diversity of mmse mimo receivers"
    - "decoding by sampling a randomized lattice algorithm for bounded distance decoding"
    - "physical layer network coding tutorial survey and beyond"
    - "integer forcing linear receivers"
    - "cyclic coded integer forcing equalization"

Connected through hyperedge HE-5 (induced by source paper "turbo lattices construction and error decoding performance"):
  with members:
    - "cycle structure of permutation functions over finite fields and their applications"
    - "low density lattice codes"
    - "on quasi cyclic interleavers for parallel turbo 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)