Sidon sets, sum-free sets and linear codes

DOI10.3934/AMC.2023054arXiv2304.07906OpenAlexW4389213214MaRDI QIDQ6433285FDOQ6433285

Authors: Ingo Czerwinski, Alexander Pott 

Publication date: 16 April 2023

Abstract: Finding the maximum size of a Sidon set in $mathbb{F}_2^t$ is of research interest for more than 40 years. In order to tackle this problem we recall a one-to-one correspondence between sum-free Sidon sets and linear codes with minimum distance greater or equal 5. Our main contribution about codes is a new non-existence result for linear codes with minimum distance 5 based on a sharpening of the Johnson bound. This gives, on the Sidon set side, an improvement of the general upper bound for the maximum size of a Sidon set. Additionally, we characterise maximal Sidon sets, that are those Sidon sets which can not be extended by adding elements without loosing the Sidon property, up to dimension 6 and give all possible sizes for dimension 7 and 8 determined by computer calculations.

Full work available at URL: https://doi.org/10.3934/amc.2023054

Recommendations

• A Small Maximal Sidon Set in ${\mathbb{Z}}_2^n$
• An Upper Bound on the Size of Sidon Sets
• On linearised polynomials, Sidon arrays and fast construction of Sidon sets
• Sidon set systems
• On generalized Sidon spaces

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65) Additive bases, including sumsets (11B13)

This page was built for publication: Sidon sets, sum-free sets and linear codes

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