A covering problem over finite rings

DOI10.1016/J.AML.2009.09.022zbMath1180.05126OpenAlexW2015900067MaRDI QIDQ847320

N. E. Zubov

Publication date: 12 February 2010

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2009.09.022

zbMATH Keywords

upper boundsfinite ringscovering problem

Mathematics Subject Classification ID

Relations with coding theory (11H71) Group actions on combinatorial structures (05E18) Finite commutative rings (13M99)

Related Items (5)

Invariant sets under linear operator and covering codes over modules ⋮ Short covering codes arising from matchings in weighted graphs ⋮ Sharp covering of a module by cyclic submodules ⋮ The covering problem for finite rings with respect to the RT-metric ⋮ A connection between sumsets and covering codes of a module

Cites Work

• Extremal problems on sum-free sets and coverings in tridimensional spaces
• Bounds for short covering codes and reactive tabu search
• On covering and coloring problems for rook domains
• Short coverings in tridimensional spaces arising from sum-free sets
• Hyper-rook Domain Inequalities
• Covering Theorems for Vectors with Special Reference to the Case of Four and Five Components
• Group Partition, Factorization and the Vector Covering Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A covering problem over finite rings