An application of coding theory to estimating Davenport constants
- 10 October 2010
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 61 (1) , 105-118
Abstract
No abstract availableKeywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Remarks on a generalization of the Davenport constantDiscrete Mathematics, 2010
- Sequences in abelian groups G of odd order without zero-sum subsequences of length exp(G)Designs, Codes and Cryptography, 2007
- Zero-sum problems in finite abelian groups: A surveyExpositiones Mathematicae, 2006
- ZERO-SUM PROBLEMS IN FINITE ABELIAN GROUPS AND AFFINE CAPSThe Quarterly Journal of Mathematics, 2006
- Non-Unique Factorizations2006
- Some remarks on Davenport constantDiscrete Mathematics, 2001
- Binary B2-Sequences : A New Upper BoundJournal of Combinatorial Theory, Series A, 2001
- Intersecting codes and independent familiesIEEE Transactions on Information Theory, 1994
- On Davenport's constantJournal of Combinatorial Theory, Series A, 1992
- Linear intersecting codesDiscrete Mathematics, 1985