Lattice covering by semicrosses of arm length 2

DOI10.1016/S0195-6698(13)80093-5zbMATH Open0728.20045OpenAlexW2016860586MaRDI QIDQ804710FDOQ804710

Authors: Sándor Szabó 

Publication date: 1991

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(13)80093-5

Recommendations

• scientific article; zbMATH DE number 3879636
• Covering radius of two-dimensional lattices
• Thin Lattice Coverings
• Packings of<tex>R^n</tex>by certain error spheres
• The perfect lattices \(\Gamma ({\mathfrak A}^ n)\), and the covering density of \(\Gamma ({\mathfrak A}^ 9)\)

zbMATH Keywords

algorithmcyclic groupscovering finite Abelian groups by cyclic subsetslattice covering constantn-dimensional polyhedronsemicross

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Finite abelian groups (20K01)

Cites Work

• Tiling, packing, and covering by clusters
• On decomposing finite abelian groups
• Splittings of finite groups

Cited In (3)

• Linear covering codes and error-correcting codes for limited-magnitude errors
• Covering Abelian groups with cyclic subsets
• Title not available (Why is that?)

This page was built for publication: Lattice covering by semicrosses of arm length 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804710)