山东理工大学学报（自然科学版）Issue(1)：56-57,61,3.
有限交换p-群中加性码的计数
Enumeration for additive codes in finite abelian p-groups
米加福 1郭膑化1
作者信息
- 1. 山东理工大学 理学院，山东 淄博255049
- 折叠
摘要
Abstract
This paper solved two kinds of enumeration for additive codes in the finite abelien p‐groups .The first kind of enumeration means to evaluate the number of any type of additive codes in any given finite abelien p‐groups ,w hile the second kind of enumeration is to evaluate the num‐ber of all the finite abelien p‐groups w hich contain the same type of additive codes and the given type of additive codes each of them contains .关键词
加性码/计数/最小上界Key words
additive codes/enumeration/the least upper bound分类
信息技术与安全科学引用本文复制引用
米加福,郭膑化..有限交换p-群中加性码的计数[J].山东理工大学学报（自然科学版）,2015,(1):56-57,61,3.
