Author(s): MI Jia-fu, GUO Bin-hua, School of Science, Shandong University of Technology
Pages: 56-57+61
Year: 2015 Issue:  1
Journal: Journal of Shandong Institute of Technology
Keyword:  additive codes; enumeration; the least upper bound;
Abstract: This paper solved two kinds of enumeration for additive codes in the finite abelien pgroups.The first kind of enumeration means to evaluate the number of any type of additive codes in any given finite abelien p-groups,while the second kind of enumeration is to evaluate the number of all the finite abelien p-groups which contain the same type of additive codes and the given type of additive codes each of them contains.