A connection between sumsets and covering codes of a module

DOI10.3934/AMC.2018035zbMATH Open1401.11018OpenAlexW2887053484MaRDI QIDQ1785002FDOQ1785002

Authors: Otávio J. N. T. N. dos Santos, Emerson L. Monte Carmelo 

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

Recommendations

• Sum-free sets and short covering codes
• scientific article; zbMATH DE number 1024657
• scientific article; zbMATH DE number 1315277
• On lengthening of covering codes
• Covering the Hamming space with sets translated by linear code vectors

zbMATH Keywords

arithmetic progressioncode over a ringmatrix methodsumsetcovering codebound on code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Structure of finite commutative rings (13M05) Additive bases, including sumsets (11B13) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)

Cites Work

• Additive combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Critical Pairs of Subsets of a Group of Prime Order
• An inverse theorem mod p
• Title not available (Why is that?)
• More coverings by rook domains
• Title not available (Why is that?)
• Title not available (Why is that?)
• On covering and coloring problems for rook domains
• Hyper-rook Domain Inequalities
• A covering problem over finite rings
• Invariant sets under linear operator and covering codes over modules
• On lengthening of covering codes
• Sharp covering of a module by cyclic submodules

Cited In (1)

• Sum-free sets and short covering codes

This page was built for publication: A connection between sumsets and covering codes of a module

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