Sequences in abelian groups G of odd order without zero-sum subsequences of length exp(G)-Reference-Cited by-同舟云学术

Sequences in abelian groups G of odd order without zero-sum subsequences of length exp(G)

Published:2007-07-12 Issue:1-3 Volume:47 Page:125-134
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des. Codes Cryptogr.

Author:

Edel Yves

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10623-007-9085-2.pdf

Reference17 articles.

1. Barát J, Edel Y, Hill R and Storme L (2004). On complete caps in the projective geometries over $${\mathbb{F}}_3$$ II: new improvements. J Comb Math Comb Comput 49: 9–31

2. Bierbrauer J (2003). Large caps. J Geom 76: 16–51

3. Bierbrauer J and Edel Y (2002). Bounds on affine caps. J Comb Designs 10: 111–115

4. Calderbank AR and Fishburn PC (1994). Maximal three-independent subsets of {0,1,2} n . Designs Codes Cryptography 4: 203–211

5. Edel Y and Bierbrauer J (1999). 41 is the largest size of a cap in PG(4, 4). Designs Codes Cryptography 16(2): 151–160

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Slice Rank Polynomial Method – A Survey a Few Years Later;Surveys in Combinatorics 2024;2024-06-13

2. On zero-sum subsequences of length kexp⁡(G) II;Journal of Combinatorial Theory, Series A;2022-04

3. On the size of subsets of $$\mathbb{F}_p^n$$ without p distinct elements summing to zero;Israel Journal of Mathematics;2021-05-07

4. Caps and progression-free sets in $${{\mathbb {Z}}}_m^n$$;Designs, Codes and Cryptography;2020-06-16

5. Inverse zero-sum problems for certain groups of rank three;Acta Mathematica Hungarica;2019-09-04