Counting subset sums of finite abelian groups

Authors:
Jiyou Li;Daqing Wan
Affiliations:
Department of Mathematics, Shanghai Jiao Tong University, Shanghai, PR China;Department of Mathematics, University of California, Irvine, CA 92697-3875, USA
Venue:
Journal of Combinatorial Theory Series A
Year:
2012

Citing 4
Cited 3

Concrete Mathematics: A Foundation for Computer Science

Concrete Mathematics: A Foundation for Computer Science
Introduction to Algorithms

Introduction to Algorithms
On deciding deep holes of Reed-Solomon codes

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Hard Problems of Algebraic Geometry Codes

IEEE Transactions on Information Theory

Computing error distance of reed-solomon codes

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Stopping set distributions of algebraic geometry codes from elliptic curves

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
The subset sum problem for finite abelian groups

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we obtain an explicit formula for the number of zero-sum k-element subsets in any finite abelian group.