An application of coding theory to estimating Davenport constants (Q634137): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1007.0259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear intersecting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting codes and independent families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary \(B_2\)-sequences: a new upper bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on Davenport constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences in abelian groups \(G\) of odd order without zero-sum subsequences of length \(\exp(G)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: ZERO-SUM PROBLEMS IN FINITE ABELIAN GROUPS AND AFFINE CAPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on a generalization of the Davenport constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-sum problems in finite Abelian groups: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5852785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5200682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Davenport's constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Davenport's constant and its arithmetical applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal 2-coverings of a finite affine space based on GF(2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the growth of Davenport's constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An uncertainty inequality and zero subsums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear binary codes with intersection properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem on finite Abelian groups. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial problem on finite Abelian groups. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal caps in \(\mathrm{AG}(6,3)\). / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5728513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5603259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656945 / rank
 
Normal rank

Latest revision as of 09:24, 4 July 2024

scientific article
Language Label Description Also known as
English
An application of coding theory to estimating Davenport constants
scientific article

    Statements

    An application of coding theory to estimating Davenport constants (English)
    0 references
    0 references
    2 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Davenport constant
    0 references
    binary linear code
    0 references
    intersecting code
    0 references
    zero-sum sequence
    0 references
    0 references
    0 references