An application of coding theory to estimating Davenport constants

DOI10.1007/S10623-010-9441-5MaRDI QIDQ634137zbMATH OpenOpenAlexFDO

Authors Alain Plagne, Wolfgang A. Schmid

Publication date 2 August 2011

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1007.0259

zbMATH Keywords

binary linear codeDavenport constantintersecting codezero-sum sequence

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30) Other combinatorial number theory (11B75) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: We investigate a certain well-established generalization of the Davenport constant. For $j$ a positive integer (the case $j=1$, is the classical one) and a finite Abelian group $(G,+,0)$, the invariant $Da{v}_j(G)$ is defined as the smallest $ell$ such that each sequence over $G$ of length at least $ell$ has $j$ disjoint non-empty zero-sum subsequences. We investigate these quantities for elementary $2$-groups of large rank (relative to $j$). Using tools from coding theory, we give fairly precise estimates for these quantities. We use our results to give improved bounds for the classical Davenport constant of certain groups.

Recommendations

• Remarks on a generalization of the Davenport constant
• Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory
• On Davenport's constant
• New upper bounds for the Davenport and for the Erdős-Ginzburg-Ziv constants
• ON DAVENPORT'S CONSTANT

Cites work

• A combinatorial problem on finite Abelian groups. I
• A combinatorial problem on finite Abelian groups. II
• A generalization of Davenport's constant and its arithmetical applications
• A note on the growth of Davenport's constant
• An uncertainty inequality and zero subsums
• Binary \(B_2\)-sequences: a new upper bound
• Davenport's constant for groups of the form \(\mathbb Z_3\oplus\mathbb Z_3\oplus\mathbb Z_{3d}\)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3323054 (Why is no real title available?)
• scientific article; zbMATH DE number 3387622 (Why is no real title available?)
• scientific article; zbMATH DE number 3410920 (Why is no real title available?)
• scientific article; zbMATH DE number 3192146 (Why is no real title available?)
• scientific article; zbMATH DE number 5663737 (Why is no real title available?)
• Intersecting codes and independent families
• Linear binary codes with intersection properties
• Linear intersecting codes
• Maximal caps in \(\mathrm{AG}(6,3)\).
• Minimal 2-coverings of a finite affine space based on GF(2)
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Non-unique factorizations. Algebraic, combinatorial and analytic theory
• On Davenport's constant
• Remarks on a generalization of the Davenport constant
• Sequences in abelian groups G of odd order without zero-sum subsequences of length (G)
• Some remarks on Davenport constant
• ZERO-SUM PROBLEMS IN FINITE ABELIAN GROUPS AND AFFINE CAPS
• Zero-sum problems in finite Abelian groups: a survey

Cited in

(22)

• A generalization of Kruyswijk-Olson theorem on Davenport constant in commutative semigroups
• On product-one sequences with congruence conditions over non-abelian groups
• Representation of zero-sum invariants by sets of zero-sum sequences over a finite abelian group
• Deletion correcting codes meet the Littlewood-Offord problem
• The Davenport constant of the group \(C_2^{r-1} \oplus C_{2k}\)
• Additive combinatorics: with a view towards computer science and cryptography -- an exposition
• Zero-sum subsequences of distinct lengths
• A unifying look at zero-sum invariants
• Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory
• Erdős-Burgess constant of commutative semigroups
• Product-one subsequences over subgroups of a finite group
• scientific article; zbMATH DE number 7069666 (Why is no real title available?)
• On the Erdős-Ginzburg-Ziv constant of finite abelian groups of high rank
• On the lower bound for the length of minimal codes
• On generalized Narkiewicz constants of finite abelian groups
• The Main Zero-Sum Constants over \({\boldsymbol{D}}\) _2n \({\boldsymbol{\times C_2}}\)
• On the separating Noether number of finite abelian groups
• The geometry of intersecting codes and applications to additive combinatorics and factorization theory
• On joint short minimal zero-sum subsequences over finite abelian groups of rank two
• Remarks on a generalization of the Davenport constant
• On zero-sum problems over metacyclic groups C_n _sC₂
• On the inverse problem of the Narkiewicz-sense -constant for finite abelian groups of rank 2

This page was built for publication: An application of coding theory to estimating Davenport constants

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