A connection between sumsets and covering codes of a module
From MaRDI portal
Publication:1785002
DOI10.3934/amc.2018035zbMath1401.11018OpenAlexW2887053484MaRDI QIDQ1785002
Emerson L. Monte Carmelo, Otávio J. N. T. N. dos Santos
Publication date: 27 September 2018
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2018035
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Additive bases, including sumsets (11B13) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Structure of finite commutative rings (13M05)
Cites Work
- More coverings by rook domains
- A covering problem over finite rings
- On covering and coloring problems for rook domains
- On lengthening of covering codes
- Sharp covering of a module by cyclic submodules
- Invariant sets under linear operator and covering codes over modules
- Hyper-rook Domain Inequalities
- The Critical Pairs of Subsets of a Group of Prime Order
- An inverse theorem mod p
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A connection between sumsets and covering codes of a module