论文标题
二进制线性互补双重组代码的分类和计数
Classification and count of binary linear complementary dual group codes
论文作者
论文摘要
我们建立了有限组的互补二元组的二进制组代码的完整分类，并明确确定了使用循环组合库的线性互补双（LCD）循环组代码的数量。探索了LCD组代码的尺寸和最小距离。最后，我们发现LCD MDS组代码与最大理想之间的联系。
We establish a complete classification of binary group codes with complementary duals for a finite group and explicitly determine the number of linear complementary dual (LCD) cyclic group codes by using cyclotomic cosets. The dimension and the minimum distance for LCD group codes are explored. Finally, we find a connection between LCD MDS group codes and maximal ideals.
