Covering polynomials and projections of self-dual codes

被引:0
|
作者
Janusz, Gerald J. [1 ]
机构
[1] Univ Illinois, Math, Champaign, IL 61820 USA
关键词
Binary codes; Self-dual; Designs; Projections;
D O I
10.1007/s10623-022-01091-7
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We give two formulas involving covering polynomials and use them to study projections C -> C*v for binary self-dual codes C and vectors v. The dimension of C*v is determined in terms of the weight of v and the number of codewords covered by v. These projections are very useful in the study of self-dual codes. An example is given proving some new properties of a doubly-even self-dual code with parameters [72, 36, 12].
引用
收藏
页码:2481 / 2489
页数:9
相关论文
共 50 条